default search action
Operations Research Letters, Volume 34
Volume 34, Number 1, January 2006
- Alexander Shapiro:
On complexity of multistage stochastic programs. 1-8 - Derek E. Armstrong, Sheldon H. Jacobson
:
Order preserving reductions and polynomial improving paths. 9-16 - Olivier Gossner, Penélope Hernández:
Coordination through De Bruijn sequences. 17-21 - Pedro Calleja
Job scheduling, cooperation, and control. 22-28 - Nihat Kasap
Minimizing makespan on a single machine subject to random breakdowns. 29-36 - T. C. Edwin Cheng
Scheduling with step-improving processing times. 37-40 - Özlem Ergun, James B. Orlin
Fast neighborhood search for the single machine total weighted tardiness problem. 41-45 - Anand A. Paul:
On the unimodality of the manufacturer's objective function in the newsvendor model. 46-48 - José E. Valdés
On the optimal allocation of two active redundancies in a two-component series system. 49-52 - Donglei Du
An improved algorithm for decomposing arc flows into multipath flows. 53-57 - Natashia Boland
Accelerated label setting algorithms for the elementary resource constrained shortest path problem. 58-68 - Adam Kasperski
The robust shortest path problem in series-parallel multidigraphs with interval data. 69-76 - Anna Galluccio, Paolo Nobili
Improved approximation of maximum vertex cover. 77-84 - José R. Correa:
Resource augmentation in two-dimensional packing with orthogonal rotations. 85-93 - Nicolai N. Pisaruk
A 2-approximation algorithm for the network substitution problem. 94-96 - Arie Tamir:
Locating two obnoxious facilities using the weighted maximin criterion. 97-105 - Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto
The traveling salesman problem with few inner points. 106-110 - Snezana Mitrovic-Minic, Ramesh Krishnamurti:
The multiple TSP with time windows: vehicle bounds based on precedence graphs. 111-120
Volume 34, Number 2, March 2006
- Madhur Malik, S. R. Mohan:
Cone complementarity problems with finite solution sets. 121-126 - Yu Ying Zhou, Xiaoqi Yang
Augmented Lagrangian function, non-quadratic growth condition and exact penalization. 127-134 - Jinyan Fan, Pu-yan Nie
Quadratic programs over the Stiefel manifold. 135-141 - Nicolae Popovici
Structure of efficient sets in lexicographic quasiconvex multicriteria optimization. 142-148 - M. V. Devyaterikova, Aleksandr Aleksandrovich Kolokolov
On the stability of some integer programming algorithms. 149-154 - Lars Relund Nielsen
Finding the K shortest hyperpaths using reoptimization. 155-164 - Igor Averbakh, Vasilij Lebedev:
The competitive salesman problem on a network: a worst-case approach. 165-174 - Vladimir G. Deineko, Gerhard J. Woeginger:
On the robust assignment problem under a fixed number of cost scenarios. 175-179 - Vivek F. Farias, Benjamin Van Roy:
Approximation algorithms for dynamic resource allocation. 180-190 - Refael Hassin, Moshe Haviv:
Who should be given priority in a queue? 191-198 - Jiankui Yang, Jim G. Dai
A simple proof of diffusion approximations for LBFS re-entrant lines. 199-204 - Thomas Hanschke:
Approximations for the mean queue length of the GIX/G(b, b)/c queue. 205-213 - Serhan Ziya, Hayriye Ayhan, Robert D. Foley:
Optimal prices for finite capacity queueing systems. 214-218 - Nelly Litvak:
Optimal picking of large orders in carousel systems. 219-227 - Thomas L. Magnanti, Zuo-Jun Max Shen
Inventory placement in acyclic supply chain networks. 228-238 - Jean Derks:
Book review. 239-240
Volume 34, Number 3, May 2006
- Yongpei Guan, Shabbir Ahmed
On formulations of the stochastic uncapacitated lot-sizing problem. 241-250 - Hark-Chin Hwang, Wikrom Jaruphongsa:
Dynamic lot-sizing model with demand time windows and speculative cost structure. 251-256 - Adriana Felicia Gabor
An approximation algorithm for a facility location problem with stochastic demands and inventories. 257-263 - Abdelaziz Foul:
A 1-center problem on the plane with uniformly distributed demand points. 264-268 - Vladimir G. Deineko, Bettina Klinz
Exact algorithms for the Hamiltonian cycle problem in planar graphs. 269-274 - Andreas Westerlund, Maud Göthe-Lundgren, Torbjörn Larsson
A note on relatives to the Held and Karp 1-tree problem. 275-282 - Zeev Nutov, Israel Beniaminy, Raphael Yuster:
A (1-1/e)-approximation algorithm for the generalized assignment problem. 283-288 - Giuseppe Lancia
A polynomial case of the parsimony haplotyping problem. 289-295 - François Vanderbeck, Martin W. P. Savelsbergh
A generic view of Dantzig-Wolfe decomposition in mixed integer programming. 296-306 - Matthew D. Bailey, Steven M. Shechter, Andrew J. Schaefer
SPAR: stochastic programming with adversarial recourse. 307-315 - Alexey Y. Golubin
Optimal decision rule in forming an insurance portfolio. 316-322 - Xin Chen, David Simchi-Levi:
Coordinating inventory control and pricing strategies: The continuous review model. 323-332 - Jeroen Van Velthoven, Benny Van Houdt, Chris Blondia:
On the probability of abandonment in queues with limited sojourn and waiting times. 333-338 - Florin Avram, Antonio Gómez-Corral
On the optimal control of a two-queue polling model. 339-348 - Jeff D. Griffiths, Ganna Leonenko, Janet E. Williams:
The transient solution to M/Ek/1 queue. 349-354 - Ivo J. B. F. Adan, J. S. H. van Leeuwaarden, Erik M. M. Winands:
On the application of Rouché's theorem in queueing theory. 355-360
Volume 34, Number 4, July 2006
- Tobias Achterberg, Thorsten Koch
MIPLIB 2003. 361-372 - Ramprasad Potluri, Lawrence E. Holloway:
Determining the right-hand vectors of an irredundant linear inequality system. 373-381 - Juan González-Hernández, J. Rigoberto Gabriel:
On the consistency of the mass transfer problem. 382-386 - Pierre Bonami, Michel Minoux:
Exact MAX-2SAT solution via lift-and-project closure. 387-393 - Alberto Ceselli
An optimization algorithm for a penalized knapsack problem. 394-404 - Dennis C. Dietz:
A mathematical programming approach to key-based election analysis. 405-411 - Zeynep Müge Avsar
A note on two-person zero-sum communicating stochastic games. 412-420 - Dachuan Xu
The k-level facility location game. 421-426 - Juan José Saameño Rodríguez, C. Guerrero García
A general model for the undesirable single facility location problem. 427-436 - Eduardo Uchoa
Reduction tests for the prize-collecting Steiner problem. 437-444 - Robert D. Carr, Ojas Parekh:
A 1/2-integral relaxation for the A-matching problem. 445-450 - Carl Bussema, Eric Torng:
Greedy multiprocessor server scheduling. 451-458 - Irina V. Gribkovskaia
Three is easy, two is hard: open shop sum-batch scheduling problem refined. 459-464 - Janny May-Yee Leung
An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times. 465-472 - Zhe George Zhang:
On the convexity of the two-threshold policy for an M/G/1 queue with vacations. 473-476 - Marie-Christine Costa, Lucas Létocart, Frédéric Roupin:
Erratum to "A greedy algorithm for multicut and integral multiflow in rooted tress" [Oper. Res. Lett 31(1) (2003) 21-27]. 477
Volume 34, Number 5, September 2006
- Michele Aghassi, Dimitris Bertsimas, Georgia Perakis:
Solving asymmetric variational inequalities via convex optimization. 481-490 - Elena Grigorieva, P. Jean-Jacques Herings
The communication complexity of private value single-item auctions. 491-498 - Shuchi Chawla, Uday Rajan, R. Ravi, Amitabh Sinha:
Min-Max payoffs in a two-player location game. 499-507 - Ningxiong Xu:
Flexible supply policy with options and capacity constraints. 508-516 - Ju-Liang Zhang, Jian Chen:
Bayesian solution to pricing and inventory control under unknown demand distribution. 517-524 - Delia Montoro-Cazorla
Reliability of a system under two types of failures using a Markovian arrival process. 525-530 - Jiyeon Lee, Jongwoo Kim:
A workload-dependent M/G/1 queue under a two-stage service policy. 531-538 - Abhijit Datta Banik
Finite buffer vacation models under E-limited with limit variation service and Markovian arrival process. 539-547 - Che Soong Kim, Aliaksandr Kanechny, Alexander N. Dudin:
Threshold control by a single-server retrial queue with batch arrivals and group services. 548-556 - Javiera Barrera
Limiting search cost distribution for the move-to-front rule with random request probabilities. 557-563 - Friedrich Eisenbrand, Gennady Shmonin:
Carathéodory bounds for integer cones. 564-568 - Hatem Ben Amor, Jacques Desrosiers, François Soumis:
Recovering an optimal LP basis from an optimal dual solution. 569-576 - Geir Dahl
On the k edge-disjoint 2-hop-constrained paths polytope. 577-582 - Tobias Brüggemann, Johann L. Hurink
Quality of move-optimal schedules for minimizing total weighted completion time. 583-590 - Francis Sourd:
Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints. 591-598
Volume 34, Number 6, November 2006
- Giuseppe F. Italiano
Design of trees in the hose model: The balanced case. 601-606 - Zsolt Fekete:
Source location with rigidity and tree packing requirements. 607-612 - Mohammed Fazle Baki:
A new asymmetric pyramidally solvable class of the traveling salesman problem. 613-620 - Jesper Larsson Träff:
Direct graph k-partitioning with a Kernighan-Lin like heuristic. 621-629 - Yaodong Cui:
Simplest optimal cutting patterns for equal rectangles. 630-638 - Mariana S. Escalante, M. S. Montelar, Graciela L. Nasini:
Minimal N+-rank graphs: Progress on Lipták and Tunçel's conjecture. 639-646 - Guanglu Zhou, Liqun Qi
On the convergence of an inexact Newton-type method. 647-652 - Nilay Noyan
Relaxations of linear programming problems with first order stochastic dominance constraints. 653-659 - Abdullah Konak
A new mixed integer programming formulation for facility layout design using flexible bays. 660-672 - Zuo-Jun Max Shen
A profit-maximizing supply chain network design model with demand choice flexibility. 673-682 - Dvir Shabtay
Two due date assignment problems in scheduling a single machine. 683-691 - Jongho Park, Soo Y. Chang, Kangbok Lee
Online and semi-online scheduling of two machines under a grade of service provision. 692-696 - Nathan P. Sherman, Jeffrey P. Kharoufeh
An M/M/1 retrial queue with unreliable server. 697-705 - Kyung C. Chae, Sangmin Lee, Ho Woo Lee:
On stochastic decomposition in the GI/M/1 queue with single exponential vacation. 706-712 - Anna Jaskiewicz
Optimality in Feller semi-Markov control processes. 713-718
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-13 19:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: