Operations Research Letters, Volume 32
Volume 32, Number 1, January 2004
Cor A. J. Hurkens, Gerhard J. Woeginger: On the nearest neighbor rule for the traveling salesman problem. 1-4- Tamás Fleiner, András Frank, Satoru Iwata: A constrained independent set problem for matroids. 23-26
- Akiyoshi Shioura: The MA-ordering max-flow algorithm is not strongly polynomial for directed networks. 31-35
- Ionut D. Aron, Pascal Van Hentenryck: On the complexity of the robust spanning tree problem with interval data. 36-40
- Maxim Sviridenko: A note on maximizing a submodular set function subject to a knapsack constraint. 41-43
- Ahmet B. Keha, Ismael R. de Farias Jr., George L. Nemhauser: Models for representing piecewise linear cost functions. 44-48
- Dorit S. Hochbaum: Monotonizing linear programs with up to two nonzeroes per column. 49-58
- András Prékopa, Xiaoling Hou: A stochastic programming model to find optimal sample sizes to estimate unknown parameters in an LP. 59-67
- Andrea Grosso, Federico Della Croce, Roberto Tadei: An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. 68-72
- Adam Wierman, Nikhil Bansal, Mor Harchol-Balter: A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues. 73-76
- Bong Dae Choi, Bara Kim, Gang Uk Hwang, Jae-kyoon Kim: The analysis of a multiserver queue fed by a discrete autoregressive process of order 1. 85-93
Volume 32, Number 2, March 2004
- Eric Rosenberg: The expected length of a random line segment in a rectangle. 99-102
- Anand Paul, Genaro Gutierrez: Mean sample spacings, sample size and variability in an auction-theoretic framework. 103-108
- Andrew B. Philpott, Geoffrey Pritchard: Financial transmission rights in convex pool markets. 109-113
- P. A. Kattuman, R. J. Green, Janusz W. Bialek: Allocating electricity transmission costs through tracing: a game-theoretic rationale. 114-120
- Andreas Ehrenmann: Manifolds of multi-leader Cournot equilibria. 121-125
- Jean B. Lasserre: Integer programming, Barvinok's counting algorithm and Gomory relaxations. 133-137
- Thorsten Koch: The final NETLIB-LP results. 138-142
- Tomás Tichý: Randomized on-line scheduling on three processors. 152-158
- Alberto Caprara, Ulrich Pferschy: Worst-case analysis of the subset sum algorithm for bin packing. 159-166
- Igor Averbakh: Minmax regret linear resource allocation problems. 174-180
- Eddie Cheng, Sven de Vries: Separating multi-oddity constrained shortest circuits over the polytope of stable multisets. 181-184
- Raf Jans, Zeger Degraeve: Improved lower bounds for the capacitated lot sizing problem with setup times. 185-195
- Jeffrey P. Kharoufeh: Erratum to "Explicit results for wear processes in a Markovian environment" [Oper. Res. Lett. 31(3) (2003) 237-244]. 196
- Paul A. Rubin: Comment on "A nonlinear Lagrangian dual for integer programming". 197-198
Volume 32, Number 3, May 2004
- Yuliy M. Baryshnikov, Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic, Dan Rubenstein: Flood search under the California Split rule. 199-206
- Woonghee Tim Huh: Finding 2-edge connected spanning subgraphs. 212-216
- Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse: Local approximations for maximum partial subgraph problem. 217-224
- Roberto Montemanni, Luca Maria Gambardella, Alberto V. Donati: A branch and bound algorithm for the robust shortest path problem with interval data. 225-232
- Sung-Pil Hong, Sung-Jin Chung, Bum Hwan Park: A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. 233-239
- Patrice Marcotte, Gilles Savard, Frédéric Semet: A bilevel programming approach to the travelling salesman problem. 240-248
- Arie Tamir: Sorting weighted distances with applications to objective function evaluations in single facility location problems. 249-257
- Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania: Preemptive scheduling of equal-length jobs to maximize weighted throughput. 258-264
- Jiyeon Lee: Asymptotics of overflow probabilities in Jackson networks. 265-272
- Matthieu van der Heijden, Aart van Harten, Andrei Sleptchenko: Approximations for Markovian multi-class queues with preemptive priorities. 273-282
- Elmira Popova: Basic optimality results for Bayesian group replacement policies. 283-287
- Edmond J. Vanderperre: Reliability analysis of a renewable multiple cold standby system. 288-292
Volume 32, Number 4, July 2004
- John J. Bartholdi III, Paul Goldsman: The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle. 304-308
- Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha: Min-max tree covers of graphs. 309-315
- Asaf Levin: A better approximation algorithm for the budget prize collecting tree problem. 316-319
- Gerhard J. Woeginger: Inapproximability results for no-wait job shop scheduling. 320-325
- Fabrice Tercinet, Christophe Lenté, Emmanuel Néron: Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines. 326-330
- Tamás Kis: On the complexity of the car sequencing problem. 331-335
- Gautam Appa, Dimitris Magos, Ioannis Mourtos: An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6. 336-344
- Uwe Schäfer: On the modulus algorithm for the linear complementarity problem. 350-354
- Mohan L. Chaudhry, S. H. Seok Ho Chang: Analysis of the discrete-time bulk-service queue Geo/GY/1/N+B. 355-363
- Y. W. Yang Woo Shin: BMAP/G/1 queue with correlated arrivals of customers and disasters. 364-373
- Srinagesh Gavirneni: Periodic review inventory control with fluctuating purchasing costs. 374-379
- G. Petrella: An extension of the Euler Laplace transform inversion algorithm with applications in option pricing. 380-389
- Rudolf Müller: Book reviews. 390-391
- David Hartvigsen: Book review. 391-392
- Adam N. Letchford: Book review. 393-394
- Gilbert Laporte: Book review. 394-397
Volume 32, Number 5, September 2004
- Michael A. Zazanis: Cycle times in single server cyclic Jackson networks. 422-430
- Refik Güllü: Analysis of an M/G/ queue with batch arrivals and batch-dedicated servers. 431-438
- Attahiru Sule Alfa: Loss probability in an overloaded discrete-time GI/G/1/K system with very large K. 439-447
- Hanif D. Sherali, Churlzu Lim: On embedding the volume algorithm in a variable target value method. 455-462
- Javier Peña: Conic systems and sublinear mappings: equivalent approaches. 463-467
- Kazuo Murota, Hiroo Saito, Robert Weismantel: Optimality criterion for a class of nonlinear integer programs. 468-472
- Samir Khuller, Yoo Ah Kim: Equivalence of two linear programming relaxations for broadcast scheduling. 473-478
- Carla P. Gomes, Rommel G. Regis, David B. Shmoys: An improved approximation algorithm for the partial Latin square extension problem. 479-484
- Nicole Megow, Andreas S. Schulz: On-line scheduling to minimize average completion time revisited. 485-490
- Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha: An approximation algorithm for the edge-dilation k-center problem, . 491-495
- Alberto Caprara: Book reviews. 496-497
- Gerhard Reinelt: Book review. 497-498
Volume 32, Number 6, November 2004
- Andrew B. Kahng, Sherief Reda: Match twice and stitch: a new TSP tour construction heuristic. 499-509
- Dimitris Bertsimas, Dessislava Pachamanova, Melvyn Sim: Robust linear optimization under general norms. 510-516
- Wanpracha Art Chaovalitwongse, Panos M. Pardalos, Oleg A. Prokopyev: A new linearization technique for multi-quadratic 0-1 programming problems. 517-522
- Marco Locatelli, Immanuel M. Bomze, Marcello Pelillo: The combinatorics of pivoting for the maximum weight clique. 523-529
- Asaf Levin: Strongly polynomial-time approximation for a class of bicriteria problems. 530-534
- Rob van Stee: An approximation algorithm for square packing. 535-539
- Jesper Makholm Byskov: Enumerating maximal independent sets with applications to graph colouring. 547-556
- Alix Munier Kordon: Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. 557-564
- Bas van Velzen: Dominating set games. 565-573
- Bong Dae Choi, Bara Kim: Non-ergodicity criteria for denumerable continuous time Markov processes. 574-580
- Chung-Yee Lee: Inventory replenishment model: lot sizing versus just-in-time delivery. 581-590
- Uriel G. Rothblum: Tales of Hoffman. 591-594
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team