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

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
  
• Michael R. Wagner:
  Stochastic 0-1 linear programming under limited distributional information. 150-156
  
• Hans Kellerer:
  An approximation algorithm for identical parallel machine scheduling with resource dependent processing times. 157-159
  
• 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
  
• Jayavel Sounderpandian:
  Totally monotonic games and flow games. 165-167
  
• Jacques Laye, Maximilien Laye:
  Uniqueness and characterization of capacity constrained Cournot-Nash equilibrium. 168-172
  
• Nicolae Popovici:
  Involving the Helly number in Pareto reducibility. 173-176
  
• Bong-Gyu Jang, Gyoocheol Shim:
  A reflected diffusion process in a regime-switching environment. 177-183
  
• 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
  
• Zhaotong Lian, Liming Liu:
  A tandem network with MAP inputs. 189-195
  
• Mohammed Abbad, Tariq Zahratahdi:
  An algorithm for achieving proportional delay differentiation. 196-200
  
• Sunggon Kim, Jongho Bae:
  A G/M/1 queueing system with P_lambda^M-service policy. 201-204
  
• Dimitris Bertsimas, Xuan Vinh Doan, Jean B. Lasserre:
  Approximating integrals of multivariate exponentials: A moment approach. 205-210
  
• Song Wang, Xiaoqi Yang:
  A power penalty method for linear complementarity problems. 211-214
  
• Antoine Deza, Tamás Terlaky, Yuriy Zinchenko:
  Polytopes and arrangements: Diameter and curvature. 215-222
  
• Javier Peña, Juan Carlos Vera, Luis Fernando Zuluaga:
  Exploiting equalities in polynomial programming. 223-228
  
• Dorit S. Hochbaum, Erick Moreno-Centeno:
  The inequality-satisfiability problem. 229-233
  
• Ismael R. de Farias Jr., Ming Zhao, Hai Zhao:
  A special ordered set approach for optimizing a discontinuous separable piecewise linear function. 234-238
  
• Brahim Chaourar:
  On the Kth best base of a matroid. 239-242
  
• Refael Hassin, Ariel Keinan:
  Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP. 243-246
  
• Sven Oliver Krumke, Anne Schwahn, Rob van Stee, Stephan Westphal:
  A monotone approximation algorithm for scheduling with precedence constraints. 247-249
  
• Zhiyi Tan, Shaohua Yu:
  Online scheduling with reassignment. 250-254
  
• Ruyan Fu, Ji Tian, Jinjiang Yuan, Cheng He:
  On-line scheduling on a batch machine to minimize makespan with limited restarts. 255-258
  
• Serhan Duran, Tieming Liu, David Simchi-Levi, Julie L. Swann:
  Policies utilizing tactical inventory for service-differentiated customers. 259-264
  
• Mingzhou Jin, Kai Liu, Burak Eksioglu:
  A column generation approach for the split delivery vehicle routing problem. 265-270
  
• Eduardo Conde:
  A note on the minmax regret centdian location on trees. 271-275
  
• 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
  
• 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
  

Volume 36, Number 3, May 2008

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

Volume 36, Number 4, July 2008

• Bernhard Haeupler, Robert Endre Tarjan:
  Finding a feasible flow in a strongly connected network. 397-398
  
• Joseph Cheriyan, Howard J. Karloff, Rohit Khandekar, Jochen Könemann:
  On the integrality ratio for tree augmentation. 399-401
  
• Santosh N. Kabadi, Abraham P. Punnen:
  A strongly polynomial simplex method for the linear fractional assignment problem. 402-407
  
• Ulrich Brenner:
  A faster polynomial algorithm for the unbalanced Hitchcock transportation problem. 408-413
  
• Eissa Nematollahi, Tamás Terlaky:
  A redundant Klee-Minty construction with all the redundant constraints touching the feasible region. 414-418
  
• Anna Galluccio, Claudio Gentile, Paolo Ventura:
  Gear composition and the stable set polytope. 419-423
  
• Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard:
  Some tractable instances of interval data minmax regret problems. 424-429
  
• Christoph Buchheim, Frauke Liers, Marcus Oswald:
  Local cuts revisited. 430-433
  
• Oleg V. Shylo, Oleg A. Prokopyev, Vladimir Shylo:
  Solving weighted MAX-SAT via global equilibrium search. 434-438
  
• Jon Lee, Shmuel Onn, Robert Weismantel:
  On test sets for nonlinear integer maximization. 439-443
  
• Nikolaos Papadakos:
  Practical enhancements to the Magnanti-Wong method. 444-449
  
• Andrew B. Philpott, Z. Guan:
  On the convergence of stochastic dual dynamic programming and related methods. 450-455
  
• Chen Ling, Liqun Qi, Guanglu Zhou, Louis Caccetta:
  The SC. 456-460
  
• Didier Aussel, Joydeep Dutta:
  Generalized Nash equilibrium problem, variational inequality and quasiconvexity. 461-464
  
• Wilco van den Heuvel, Albert P. M. Wagelmans:
  Four equivalent lot-sizing models. 465-470
  
• Sigrid Knust:
  Scheduling sports tournaments on a single court minimizing waiting times. 471-476
  
• Lingfa Lu, Jinjiang Yuan:
  Unbounded parallel batch scheduling with job delivery to minimize makespan. 477-480
  
• Oded Berman, Zvi Drezner:
  A new formulation for the conditional p. 481-483
  
• Daniel Adelman:
  A simple algebraic approximation to the Erlang loss system. 484-491
  
• Dimitrios G. Pandelis:
  Optimal stochastic scheduling of two interconnected queues with varying service rates. 492-495
  
• P. Moyal:
  Convex comparison of service disciplines in real time queues. 496-499
  
• Robert D. van der Mei, Erik M. M. Winands:
  A note on polling models with renewal arrivals and nonzero switch-over times. 500-505
  
• Youyi Feng, Jihong Ou, Zhan Pang:
  Optimal control of price and production in an assemble-to-order system. 506-512
  
• Dries R. Goossens:
  Peter Cramton, Yoav Shoham and Richard Steinberg, Editors, Combinatorial Auctions, MIT Press, Cambridge, Massachusetts & London, England (2006) ISBN 0-262-03342-9, p. 669. 513-514
  

Volume 36, Number 5, September 2008

• Wei Wang, Shabbir Ahmed:
  Sample average approximation of expected value constrained stochastic programs. 515-519
  
• Richa Agarwal, Özlem Ergun:
  Mechanism design for a multicommodity flow game in service network alliances. 520-524
  
• Philippe Bich:
  An answer to a question by Herings et al. 525-526
  
• Eugene A. Feinberg, Fenghsu Yang:
  On polynomial cases of the unichain classification problem for Markov Decision Processes. 527-530
  
• Anna Jaskiewicz:
  A note on negative dynamic programming for risk-sensitive control. 531-534
  
• Aïcha Bareche, Djamil Aïssani:
  Kernel density in the study of the strong stability of the M/M/1 queueing system. 535-538
  
• Mehmet Murat Fadiloglu, Emre Berk, Mustafa Çagri Gürbüz:
  Supplier diversification under binomial yield. 539-542
  
• Oguz Solyali, Haldun Süral:
  A single supplier-single retailer system with an order-up-to level inventory policy. 543-546
  
• Woonghee Tim Huh, Ganesh Janakiraman:
  A sample-path approach to the optimality of echelon order-up-to policies in serial inventory systems. 547-550
  
• Mustafa K. Dogru, G. J. van Houtum, A. G. de Kok:
  Newsvendor equations for optimal reorder levels of serial inventory systems with fixed batch sizes. 551-556
  
• Josep Freixas, Montserrat Pons:
  The influence of the node criticality relation on some measures of component importance. 557-560
  
• I. T. Castro, E. L. Sanjuán:
  An optimal maintenance policy for repairable systems with delayed repairs. 561-564
  
• Natali Hritonenko, Yuri Yatsenko:
  The dynamics of asset lifetime under technological change. 565-568
  
• Maqbool Dada, Qiaohai Hu:
  Financing newsvendor inventory. 569-573
  
• Tracy Kimbrel, Maxim Sviridenko:
  High-multiplicity cyclic job shop scheduling. 574-578
  
• Lele Zhang, Kwanniti Khammuang, Andrew Wirth:
  On-line scheduling with non-crossing constraints. 579-583
  
• Q. Q. Nong, T. C. Edwin Cheng, C. T. Ng:
  An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines. 584-588
  
• Sunantha Teyarachakul, Suresh Chand, James Ward:
  Batch sizing under learning and forgetting: Steady state characteristics for the constant demand case. 589-593
  
• Heather Hulett, Todd G. Will, Gerhard J. Woeginger:
  Multigraph realizations of degree sequences: Maximization is easy, minimization is hard. 594-596
  
• Eitan Bachmat, Michael Elkin:
  Bounds on the performance of back-to-front airplane boarding policies. 597-601
  
• Prashant Sasatte:
  Improved approximation algorithm for the feedback set problem in a bipartite tournament. 602-604
  
• Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie:
  An approximation algorithm for the wireless gathering problem. 605-608
  
• Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld:
  Optimal bundle pricing with monotonicity constraint. 609-614
  
• Benjamin McClosky, Illya V. Hicks:
  Composition of stable set polyhedra. 615-617
  
• Alper Atamtürk, Vishnu Narayanan:
  Polymatroids and mean-risk minimization in discrete optimization. 618-622
  
• Peter Butkovic:
  Finding a bounded mixed-integer solution to a system of dual network inequalities. 623-627
  
• Olivier Klopfenstein, Dritan Nace:
  A robust approach to the chance-constrained knapsack problem. 628-632
  
• Jorge Navas, Jesús Marín-Solano:
  Cost of capital for incentives on capacity expansion investments. 633-636
  
• Fu-Quan Xia, Nan-Jing Huang, Zhi-bin Liu:
  A projected subgradient method for solving generalized mixed variational inequalities. 637-642
  
• Andreas Fischer, Pradyumn Kumar Shukla:
  A Levenberg-Marquardt algorithm for unconstrained multicriteria optimization. 643-646
  
• Agnieszka B. Malinowska:
  Weakly and properly nonessential objectives in multiobjective optimization problems. 647-650
  
• Rubén López, Cristian Vera:
  On the set of weakly efficient minimizers for convex multiobjective programming. 651-655
  
• Kirk Pruhs:
  Noam Nisan, Tim Roughgarden, Éva Tardos and Vijay V. Vazirani, Editors, Algorithmic Game Theory, Cambridge University Press (2007) ISBN 9780521872829, 776 pp. 656
  

Volume 36, Number 6, November 2008

• Boaz Golany, Uriel G. Rothblum:
  Optimal investment in development projects. 657-661
  
• Shabbir Ahmed, Damir Filipovic, Gregor Svindland:
  A note on natural risk statistics. 662-664
  
• Archis Ghate, Robert L. Smith:
  A dynamic programming approach to efficient sampling from Boltzmann distributions. 665-668
  
• Paresh Date, Rogemar S. Mamon, Luka Jalen:
  A new moment matching algorithm for sampling from partially specified symmetric distributions. 669-672
  
• Denis Cornaz, Vincent Jost:
  A one-to-one correspondence between colorings and stable sets. 673-676
  
• Damon Mosk-Aoyama:
  Maximum algebraic connectivity augmentation is NP-hard. 677-679
  
• Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
  Minimum entropy orientations. 680-683
  
• José Miguel Díaz-Báñez, Gregorio Hernández-Peñalver, Deborah Oliveros, A. Ramírez-Vigueras, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura:
  Computing shortest heterochromatic monotone routes. 684-687
  
• Mauro Dell'Amico, Manuel Iori, Daniele Pretolani:
  Shortest paths in piecewise continuous time-dependent networks. 688-691
  
• Konstantinos N. Androutsopoulos, Konstantinos G. Zografos:
  Solving the k-shortest path problem with time windows in a time varying network. 692-695
  
• Antonis Economou, Spyridoula Kanta:
  Equilibrium balking strategies in the observable single-server queue with breakdowns and repairs. 696-699
  
• Antonios Printezis, Apostolos Burnetas:
  Priority option pricing in an M/M/m. 700-704
  
• Jingui Xie, Qi-Ming He, Xiaobo Zhao:
  Stability of a priority queueing system with customer transfers. 705-709
  
• M. B. Lignola:
  Regularized gap functions for variational problems. 710-714
  
• Jinchuan Zhou, Changyu Wang:
  A note on finite termination of iterative algorithms in mathematical programming. 715-717
  
• Marko M. Mäkelä, Yury Nikulin:
  Properties of efficient solution sets under addition of objectives. 718-721
  
• Ubaldo M. García-Palomares, Juan C. Burguillo-Rial, Francisco J. González-Castaño:
  Explicit gradient information in multiobjective optimization. 722-725
  
• Ming Zhao, Ismael R. de Farias Jr.:
  A note on the continuous mixing set. 726-733
  
• Kent Andersen, Quentin Louveaux, Robert Weismantel:
  Certificates of linear mixed integer infeasibility. 734-738
  

Last update Tue May 21 19:28:18 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page