Operations Research Letters, Volume 36

Volume 36, Number 1, January 2008

• Frans Schalekamp, David B. Shmoys:
  Algorithms for the universal and a priori TSP. 1-3
  Electronic Edition (link) BibTeX
• Pierre Bonami, Gérard Cornuéjols:
  A note on the MIR closure. 4-6
  Electronic Edition (link) BibTeX
• Marco Di Summa, Laurence A. Wolsey:
  Lot-sizing on a tree. 7-13
  Electronic Edition (link) BibTeX
• Gerth Stølting Brodal, Loukas Georgiadis, Irit Katriel:
  An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree. 14-18
  Electronic Edition (link) BibTeX
• Bala Krishnamoorthy:
  Bounds on the size of branch-and-bound proofs for integer knapsacks. 19-25
  Electronic Edition (link) BibTeX
• Qin Wang, Jinjiang Yuan, Jianzhong Zhang:
  An inverse model for the most uniform problem. 26-30
  Electronic Edition (link) BibTeX
• Dániel Marx:
  Searching the k-change neighborhood for TSP is W[1]-hard. 31-36
  Electronic Edition (link) BibTeX
• Bernardetta Addis, Marco Locatelli, Fabio Schoen:
  Efficiently packing unequal disks in a circle. 37-42
  Electronic Edition (link) BibTeX
• Pei-Hao Ho, Arie Tamir, Bang Ye Wu:
  Minimum L_k path partitioning - An illustration of the Monge property. 43-45
  Electronic Edition (link) BibTeX
• Dachuan Xu, Shuzhong Zhang:
  Approximation algorithm for facility location with service installation costs. 46-50
  Electronic Edition (link) BibTeX
• Johann Hurink, Jacob Jan Paulus:
  Online scheduling of parallel jobs on two machines is 2-competitive. 51-56
  Electronic Edition (link) BibTeX
• Jin Yan:
  An improved lower bound for a bi-criteria scheduling problem. 57-60
  Electronic Edition (link) BibTeX
• Q. Q. Nong, C. T. Ng, T. C. Edwin Cheng:
  The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan. 61-66
  Electronic Edition (link) BibTeX
• Stephen E. Wright:
  Identifying the optimal partition in convex quadratic programming. 67-70
  Electronic Edition (link) BibTeX
• Lingchen Kong, Naihua Xiu, Jiye Han:
  The solution set structure of monotone linear complementarity problems over second-order cone. 71-76
  Electronic Edition (link) BibTeX
• Sungyong Choi, Andrzej Ruszczynski:
  A risk-averse newsvendor with law invariant coherent measures of risk. 77-82
  Electronic Edition (link) BibTeX
• Chung-Lun Li:
  Quantifying supply chain ineffectiveness under uncoordinated pricing decisions. 83-88
  Electronic Edition (link) BibTeX
• P. Jean-Jacques Herings, Gerard van der Laan, Dolf Talman, Zaifu Yang:
  A fixed point theorem for discontinuous functions. 89-93
  Electronic Edition (link) BibTeX
• Amitrajeet A. Batabyal, Gregory J. DeAngelo:
  To match or not to match: Aspects of marital matchmaking under uncertainty. 94-98
  Electronic Edition (link) BibTeX
• Laura Plazola Zamora, Servio Tulio Guillén Burguete:
  Second-order preferences in group decision making. 99-102
  Electronic Edition (link) BibTeX
• Gerard J. Burke, Joseph Geunes, H. Edwin Romeijn, Asoo J. Vakharia:
  Allocating procurement to capacitated suppliers with concave quantity discounts. 103-109
  Electronic Edition (link) BibTeX
• Leon Yang Chu, J. George Shanthikumar, Zuo-Jun Max Shen:
  Solving operational statistics via a Bayesian analysis. 110-116
  Electronic Edition (link) BibTeX
• P. Lieshout, Michel Mandjes:
  A note on the delay distribution in GPS. 117-122
  Electronic Edition (link) BibTeX
• Nanlian Cai, Yaohui Zheng:
  Increasing convex ordering of queue length in bulk queues. 123-126
  Electronic Edition (link) BibTeX
• Bara Kim, Jeongsim Kim, Jisu Lee:
  Asymptotic behavior of the stationary distribution in a finite QBD process with zero mean drift. 127-132
  Electronic Edition (link) BibTeX
• Mojtaba Araghi, Baris Balcioglu:
  A new renewal approximation for certain autocorrelated processes. 133-139
  Electronic Edition (link) BibTeX
• Nihat Kasap, Haldun Aytug, Anand Paul:
  Erratum to "Minimizing makespan on a single machine subject to random breakdowns": [Oper. Res. Letters 34 (2006) 29-36]. 140
  Electronic Edition (link) BibTeX

Volume 36, Number 2, March 2008

• Sophie Dewez, Martine Labbé, Patrice Marcotte, Gilles Savard:
  New formulations and valid inequalities for a bilevel pricing problem. 141-149
  Electronic Edition (link) BibTeX
• Michael R. Wagner:
  Stochastic 0-1 linear programming under limited distributional information. 150-156
  Electronic Edition (link) BibTeX
• Hans Kellerer:
  An approximation algorithm for identical parallel machine scheduling with resource dependent processing times. 157-159
  Electronic Edition (link) BibTeX
• Eitan Altman, Konstantin Avrachenkov, Nicolas Bonneau, Mérouane Debbah, Rachid El Azouzi, Daniel Sadoc Menasché:
  Constrained cost-coupled stochastic games with independent state processes. 160-164
  Electronic Edition (link) BibTeX
• Jayavel Sounderpandian:
  Totally monotonic games and flow games. 165-167
  Electronic Edition (link) BibTeX
• Jacques Laye, Maximilien Laye:
  Uniqueness and characterization of capacity constrained Cournot-Nash equilibrium. 168-172
  Electronic Edition (link) BibTeX
• Nicolae Popovici:
  Involving the Helly number in Pareto reducibility. 173-176
  Electronic Edition (link) BibTeX
• Bong-Gyu Jang, Gyoocheol Shim:
  A reflected diffusion process in a regime-switching environment. 177-183
  Electronic Edition (link) BibTeX
• Maria Estrella Sousa Vieira, Andrés Suárez-González, José C. López-Ardao, Cándido López-García, Manuel Fernández-Veiga:
  On improving the efficiency of an M/G/infinity generator of correlated traces. 184-188
  Electronic Edition (link) BibTeX
• Zhaotong Lian, Liming Liu:
  A tandem network with MAP inputs. 189-195
  Electronic Edition (link) BibTeX
• Mohammed Abbad, Tariq Zahratahdi:
  An algorithm for achieving proportional delay differentiation. 196-200
  Electronic Edition (link) BibTeX
• Sunggon Kim, Jongho Bae:
  A G/M/1 queueing system with P_lambda^M-service policy. 201-204
  Electronic Edition (link) BibTeX
• Dimitris Bertsimas, Xuan Vinh Doan, Jean B. Lasserre:
  Approximating integrals of multivariate exponentials: A moment approach. 205-210
  Electronic Edition (link) BibTeX
• Song Wang, Xiaoqi Yang:
  A power penalty method for linear complementarity problems. 211-214
  Electronic Edition (link) BibTeX
• Antoine Deza, Tamás Terlaky, Yuriy Zinchenko:
  Polytopes and arrangements: Diameter and curvature. 215-222
  Electronic Edition (link) BibTeX
• Javier Peña, Juan Carlos Vera, Luis F. Zuluaga:
  Exploiting equalities in polynomial programming. 223-228
  Electronic Edition (link) BibTeX
• Dorit S. Hochbaum, Erick Moreno-Centeno:
  The inequality-satisfiability problem. 229-233
  Electronic Edition (link) BibTeX
• Ismael R. de Farias Jr., Ming Zhao, Hai Zhao:
  A special ordered set approach for optimizing a discontinuous separable piecewise linear function. 234-238
  Electronic Edition (link) BibTeX
• Brahim Chaourar:
  On the Kth best base of a matroid. 239-242
  Electronic Edition (link) BibTeX
• Refael Hassin, Ariel Keinan:
  Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP. 243-246
  Electronic Edition (link) BibTeX
• Sven Oliver Krumke, Anne Schwahn, Rob van Stee, Stephan Westphal:
  A monotone approximation algorithm for scheduling with precedence constraints. 247-249
  Electronic Edition (link) BibTeX
• Zhiyi Tan, Shaohua Yu:
  Online scheduling with reassignment. 250-254
  Electronic Edition (link) BibTeX
• Ruyan Fu, Ji Tian, Jinjiang Yuan, Cheng He:
  On-line scheduling on a batch machine to minimize makespan with limited restarts. 255-258
  Electronic Edition (link) BibTeX
• Serhan Duran, Tieming Liu, David Simchi-Levi, Julie L. Swann:
  Policies utilizing tactical inventory for service-differentiated customers. 259-264
  Electronic Edition (link) BibTeX
• Mingzhou Jin, Kai Liu, Burak Eksioglu:
  A column generation approach for the split delivery vehicle routing problem. 265-270
  Electronic Edition (link) BibTeX
• Eduardo Conde:
  A note on the minmax regret centdian location on trees. 271-275
  Electronic Edition (link) BibTeX
• Michael Trick:
  David L. Applegate, Robert E. Bixby, Vasek Chvátal , William J. Cook. The Traveling Salesman Problem: A Computational Study, Princeton University Press, Princeton, 2007, ISBN-13: 978-0-691-12993-8, 606 pp. 276-277
  Electronic Edition (link) BibTeX
• Patric R. J. Östergård:
  P.G. Szabó, M.C. Markót, T. Csendes, E. Specht, L.G. Casado, I. García, New Approaches to Circle Packing in a Square, Springer, Berlin, 2007, ISBN: 978-0-387-45673-7, pp 238. 277-278
  Electronic Edition (link) BibTeX

Volume 36, Number 3, May 2008

• A. Geinoz, Tinaz Ekim, Dominique de Werra:
  Construction of balanced sports schedules using partitions into subleagues. 279-282
  Electronic Edition (link) BibTeX
• Dirk Briskorn:
  Feasibility of home-away-pattern sets for round robin tournaments. 283-284
  Electronic Edition (link) BibTeX
• Archis Ghate, Robert L. Smith:
  Adaptive search with stochastic acceptance probabilities for global optimization. 285-290
  Electronic Edition (link) BibTeX
• Michi Nishihara, Takashi Shibata:
  The agency problem between the owner and the manager in real investment: The bonus-audit relationship. 291-296
  Electronic Edition (link) BibTeX
• Alper Atamtürk, Simge Küçükyavuz:
  An O(n²) algorithm for lot sizing with inventory bounds and fixed costs. 297-299
  Electronic Edition (link) BibTeX
• Shaoxiang Chen, Yi Feng, Arun Kumar, Bing Lin:
  An algorithm for single-item economic lot-sizing problem with general inventory cost, non-decreasing capacity, and non-increasing setup and production cost. 300-302
  Electronic Edition (link) BibTeX
• Kai Huang, Simge Küçükyavuz:
  On stochastic lot-sizing problems with random lead times. 303-308
  Electronic Edition (link) BibTeX
• Ping-Qi Pan:
  Efficient nested pricing in the simplex algorithm. 309-313
  Electronic Edition (link) BibTeX
• Kevin K. H. Cheung:
  The equivalence of semidefinite relaxations of polynomial 0-1 and +/- 1 programs via scaling. 314-316
  Electronic Edition (link) BibTeX
• Daniel Bienstock:
  Approximate formulations for 0-1 knapsack sets. 317-320
  Electronic Edition (link) BibTeX
• Refael Hassin, Danny Segev:
  Rounding to an integral program. 321-326
  Electronic Edition (link) BibTeX
• Jens Jägersküpper:
  Lower bounds for randomized direct search with isotropic sampling. 327-332
  Electronic Edition (link) BibTeX
• Sofie Coene, Frits C. R. Spieksma:
  Profit-based latency problems on the line. 333-337
  Electronic Edition (link) BibTeX
• Mohamed Ali Aloulou, Federico Della Croce:
  Complexity of single machine scheduling problems under scenario-based uncertainty. 338-342
  Electronic Edition (link) BibTeX
• Adam Kasperski, Pawel Zielinski:
  A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion. 343-344
  Electronic Edition (link) BibTeX
• Bernard Gendron, Alain Hertz, Patrick St-Louis:
  On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem. 345-350
  Electronic Edition (link) BibTeX
• Gautier Stauffer:
  The p-median polytope of Y-free graphs: An application of the matching theory. 351-354
  Electronic Edition (link) BibTeX
• Attila Bernáth:
  Source location in undirected and directed hypergraphs. 355-360
  Electronic Edition (link) BibTeX
• Fabrizio Grandoni, Volker Kaibel, Gianpaolo Oriolo, Martin Skutella:
  A short proof of the VPN Tree Routing Conjecture on ring networks. 361-365
  Electronic Edition (link) BibTeX
• Carlos Obreque, Vladimir Marianov, Miguel Rios:
  Optimal design of hierarchical networks with free main path extremes. 366-371
  Electronic Edition (link) BibTeX
• Natalia Osipova:
  Batch processor sharing with hyper-exponential service time. 372-376
  Electronic Edition (link) BibTeX
• Fan C. Meng:
  A note on characterizations of the Natvig structure functions. 377-380
  Electronic Edition (link) BibTeX
• Roberto Cellini, Luca Lambertini, Andrea Mantovani:
  Persuasive advertising under Bertrand competition: A differential game. 381-384
  Electronic Edition (link) BibTeX
• Jein-Shan Chen, Defeng Sun, Jie Sun:
  The SC¹ property of the squared norm of the SOC Fischer-Burmeister function. 385-392
  Electronic Edition (link) BibTeX
• Milan Hladík:
  Additive and multiplicative tolerance in multiobjective linear programming. 393-396
  Electronic Edition (link) BibTeX