Journal: Oper. Res. Lett.

Volume 32, Issue 6

499 -- 509Andrew B. Kahng, Sherief Reda. Match twice and stitch: a new TSP tour construction heuristic
510 -- 516Dimitris Bertsimas, Dessislava Pachamanova, Melvyn Sim. Robust linear optimization under general norms
517 -- 522Wanpracha Art Chaovalitwongse, Panos M. Pardalos, Oleg A. Prokopyev. A new linearization technique for multi-quadratic 0-1 programming problems
523 -- 529Marco Locatelli, Immanuel M. Bomze, Marcello Pelillo. The combinatorics of pivoting for the maximum weight clique
530 -- 534Asaf Levin. Strongly polynomial-time approximation for a class of bicriteria problems
535 -- 539Rob van Stee. An approximation algorithm for square packing
540 -- 546Reuven Bar-Yehuda, Dror Rawitz. Local ratio with negative weights
547 -- 556Jesper Makholm Byskov. Enumerating maximal independent sets with applications to graph colouring
557 -- 564Alix Munier Kordon. Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay
565 -- 573Bas van Velzen. Dominating set games
574 -- 580Bong Dae Choi, Bara Kim. Non-ergodicity criteria for denumerable continuous time Markov processes
581 -- 590Chung-Yee Lee. Inventory replenishment model: lot sizing versus just-in-time delivery
591 -- 594Uriel G. Rothblum. Tales of Hoffman

Volume 32, Issue 5

399 -- 408C. C. Heyde, S. G. Kou. On the controversy over tailweight of distributions
409 -- 414Anand Paul, Indranil Bose. Demand variability and incentives in inventory-based contracts
415 -- 421I. T. Castro, E. L. Sanjuán. Power processes and their application to reliability
422 -- 430Michael A. Zazanis. Cycle times in single server cyclic Jackson networks
431 -- 438Refik Güllü. Analysis of an ::::M::::/::::G::::/ queue with batch arrivals and batch-dedicated servers
439 -- 447Attahiru Sule Alfa. Loss probability in an overloaded discrete-time GI/G/1/K system with very large ::::K::::
448 -- 454Lerzan Örmeci, Apostolos Burnetas. Admission control with batch arrivals
455 -- 462Hanif D. Sherali, Churlzu Lim. On embedding the volume algorithm in a variable target value method
463 -- 467Javier Peña. Conic systems and sublinear mappings: equivalent approaches
468 -- 472Kazuo Murota, Hiroo Saito, Robert Weismantel. Optimality criterion for a class of nonlinear integer programs
473 -- 478Samir Khuller, Yoo Ah Kim. Equivalence of two linear programming relaxations for broadcast scheduling
479 -- 484Carla P. Gomes, Rommel G. Regis, David B. Shmoys. An improved approximation algorithm for the partial Latin square extension problem
485 -- 490Nicole Megow, Andreas S. Schulz. On-line scheduling to minimize average completion time revisited
491 -- 495Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha. An approximation algorithm for the edge-dilation ::::k::::-center problem:::, :::
496 -- 497Alberto Caprara. Book reviews
497 -- 498Gerhard Reinelt. Book review

Volume 32, Issue 4

299 -- 301Bruce A. Reed, Kaleigh Smith, Adrian Vetta. Finding odd cycle transversals
302 -- 303Robert Bosch, Adrianne Herman. Continuous line drawings via the traveling salesman problem
304 -- 308John J. Bartholdi III, Paul Goldsman. The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle
309 -- 315Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha. Min-max tree covers of graphs
316 -- 319Asaf Levin. A better approximation algorithm for the budget prize collecting tree problem
320 -- 325Gerhard J. Woeginger. Inapproximability results for no-wait job shop scheduling
326 -- 330Fabrice Tercinet, Christophe Lenté, Emmanuel Néron. Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines
331 -- 335Tamás Kis. On the complexity of the car sequencing problem
336 -- 344Gautam Appa, Dimitris Magos, Ioannis Mourtos. An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6
345 -- 349Geir Dahl, Njål Foldnes, Luís Gouveia. A note on hop-constrained walk polytopes
350 -- 354Uwe Schäfer. On the modulus algorithm for the linear complementarity problem
355 -- 363Mohan L. Chaudhry, S. H. Seok Ho Chang. Analysis of the discrete-time bulk-service queue Geo/G:::Y:::/1/::::N::::+::::B::::
364 -- 373Y. W. Yang Woo Shin. ::::BMAP::::/::::G::::/1 queue with correlated arrivals of customers and disasters
374 -- 379Srinagesh Gavirneni. Periodic review inventory control with fluctuating purchasing costs
380 -- 389G. Petrella. An extension of the Euler Laplace transform inversion algorithm with applications in option pricing
390 -- 391Rudolf Müller. Book reviews
391 -- 392David Hartvigsen. Book review
393 -- 394Adam N. Letchford. Book review
394 -- 397Gilbert Laporte. Book review

Volume 32, Issue 3

199 -- 206Yuliy M. Baryshnikov, Edward G. Coffman Jr., Predrag R. Jelenkovic, Petar Momcilovic, Dan Rubenstein. Flood search under the California Split rule
207 -- 211Matthias Köppe, Robert Weismantel. Cutting planes from a mixed integer Farkas lemma
212 -- 216Woonghee Tim Huh. Finding 2-edge connected spanning subgraphs
217 -- 224Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse. Local approximations for maximum partial subgraph problem
225 -- 232Roberto Montemanni, Luca Maria Gambardella, Alberto V. Donati. A branch and bound algorithm for the robust shortest path problem with interval data
233 -- 239Sung-Pil Hong, Sung-Jin Chung, Bum Hwan Park. A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
240 -- 248Patrice Marcotte, Gilles Savard, Frédéric Semet. A bilevel programming approach to the travelling salesman problem
249 -- 257Arie Tamir. Sorting weighted distances with applications to objective function evaluations in single facility location problems
258 -- 264Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania. Preemptive scheduling of equal-length jobs to maximize weighted throughput
265 -- 272Jiyeon Lee. Asymptotics of overflow probabilities in Jackson networks
273 -- 282Matthieu van der Heijden, Aart van Harten, Andrei Sleptchenko. Approximations for Markovian multi-class queues with preemptive priorities
283 -- 287Elmira Popova. Basic optimality results for Bayesian group replacement policies
288 -- 292Edmond J. Vanderperre. Reliability analysis of a renewable multiple cold standby system
293 -- 298Yingchieh Yeh, Bruce W. Schmeiser. On the robustness of batching estimators

Volume 32, Issue 2

99 -- 102Eric Rosenberg. The expected length of a random line segment in a rectangle
103 -- 108Anand Paul, Genaro Gutierrez. Mean sample spacings, sample size and variability in an auction-theoretic framework
109 -- 113Andrew B. Philpott, Geoffrey Pritchard. Financial transmission rights in convex pool markets
114 -- 120P. A. Kattuman, R. J. Green, J. W. Bialek. Allocating electricity transmission costs through tracing: a game-theoretic rationale
121 -- 125Andreas Ehrenmann. Manifolds of multi-leader Cournot equilibria
126 -- 132Roland W. Freund, Florian Jarre. A sensitivity result for semidefinite programs
133 -- 137Jean B. Lasserre. Integer programming, Barvinok s counting algorithm and Gomory relaxations
138 -- 142Thorsten Koch. The final N::ETLIB::-LP results
143 -- 151Herminia I. Calvete, Carmen Galé. Solving linear fractional bilevel programs
152 -- 158Tomás Tichý. Randomized on-line scheduling on three processors
159 -- 166Alberto Caprara, Ulrich Pferschy. Worst-case analysis of the subset sum algorithm for bin packing
167 -- 173Young-Soo Myung, Hu-gon Kim. On the ring loading problem with demand splitting
174 -- 180Igor Averbakh. Minmax regret linear resource allocation problems
181 -- 184Eddie Cheng, Sven de Vries. Separating multi-oddity constrained shortest circuits over the polytope of stable multisets
185 -- 195Raf Jans, Zeger Degraeve. Improved lower bounds for the capacitated lot sizing problem with setup times
196 -- 0Jeffrey P. Kharoufeh. Erratum to Explicit results for wear processes in a Markovian environment [Oper. Res. Lett. 31(3) (2003) 237-244]
197 -- 198Paul A. Rubin. Comment on A nonlinear Lagrangian dual for integer programming

Volume 32, Issue 1

1 -- 4Cor A. J. Hurkens, Gerhard J. Woeginger. On the nearest neighbor rule for the traveling salesman problem
5 -- 14Alberto Caprara, Michele Monaci. On the two-dimensional Knapsack Problem
15 -- 22Geir Dahl, Luis Gouveia. On the directed hop-constrained shortest path problem
23 -- 26Tamás Fleiner, András Frank, Satoru Iwata. A constrained independent set problem for matroids
27 -- 30Abraham P. Punnen, Yash P. Aneja. Lexicographic balanced optimization problems
31 -- 35Akiyoshi Shioura. The MA-ordering max-flow algorithm is not strongly polynomial for directed networks
36 -- 40Ionut D. Aron, Pascal Van Hentenryck. On the complexity of the robust spanning tree problem with interval data
41 -- 43Maxim Sviridenko. A note on maximizing a submodular set function subject to a knapsack constraint
44 -- 48Ahmet B. Keha, Ismael R. de Farias Jr., George L. Nemhauser. Models for representing piecewise linear cost functions
49 -- 58Dorit S. Hochbaum. Monotonizing linear programs with up to two nonzeroes per column
59 -- 67András Prékopa, Xiaoling Hou. A stochastic programming model to find optimal sample sizes to estimate unknown parameters in an LP
68 -- 72Andrea Grosso, Federico Della Croce, Roberto Tadei. An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
73 -- 76Adam Wierman, Nikhil Bansal, Mor Harchol-Balter. A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues
77 -- 84Zhe George Zhang, Naishuo Tian. The ::::N:::: threshold policy for the ::::GI::::/::::M::::/1 queue
85 -- 93Bong 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
94 -- 98Jens Leth Hougaard, Hans Keiding. Continuous benchmark selections