Journal: Oper. Res. Lett.

Volume 35, Issue 6

693 -- 699David Applegate, William Cook, Sanjeeb Dash, Daniel Espinoza. Exact solutions to linear programming problems
700 -- 706Uriel G. Rothblum. Bounding the inefficiency of Nash equilibria in games with finitely many players
707 -- 712David P. Williamson, Anke van Zuylen. A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
713 -- 721Enrico Angelelli, Martin W. P. Savelsbergh, Maria Grazia Speranza. Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
722 -- 730David B. Brown. Large deviations bounds for estimating conditional value-at-risk
731 -- 738Holger Heitsch, Werner Römisch. A note on scenario reduction for two-stage stochastic programs
739 -- 742Sung-Pil Hong, Byung-Cheon Choi. Polynomiality of sparsest cuts with fixed number of sources
743 -- 746Kürsad Derinkuyu, Mustafa Ç. Pinar, Ahmet Camci. An improved probability bound for the Approximate S-Lemma
747 -- 753Waqar Malik, Sivakumar Rathinam, Swaroop Darbha. An approximation algorithm for a symmetric Generalized Multiple Depot, Multiple Travelling Salesman Problem
754 -- 758Arjen P. A. Vestjens, Marc Wennink, Gerhard J. Woeginger. Complexity of the job insertion problem in multi-stage scheduling
759 -- 766Hamish Waterer. Lot sizing with inventory gains
767 -- 772Özgür Yazlali, Feryal Erhun. Relating the multiple supply problem to quantity flexibility contracts
773 -- 781Christian H. Christiansen, Jens Lysgaard. A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
782 -- 790Jörg Fliege. The effects of adding objectives to an optimisation problem on the solution set
791 -- 798Javier Castro, Daniel Gómez, Juan Tejada. A project game for PERT networks
799 -- 804Mrinal K. Ghosh, K. S. Mallikarjuna Rao. Zero-sum stochastic games with stopping and control
805 -- 812Bernardo D Auria. Stochastic decomposition of the M/G/infinity queue in a random environment
813 -- 822Wikrom Jaruphongsa, Sila Çetinkaya, Chung-Yee Lee. Outbound shipment mode considerations for integrated inventory and delivery lot-sizing decisions
823 -- 824Samuel Fiorini. K. Aardal, G. Nemhauser, R. Weismantel (Eds.), Handbooks in Operations Research and Management Science, Vol. 12, Discrete Optimization, Elsevier, Amsterdam, The Netherlands, 2006, ISBN: 0-444-51507-0, 607 pp., EUR 179, 197

Volume 35, Issue 5

561 -- 566Qiaohai (Joice) Hu, Matthew J. Sobel. Echelon base-stock policies are financially sub-optimal
567 -- 572Christian Larsen, Gudrun P. Kiesmüller. Developing a closed-form cost expression for an (R, s, nQ) policy where the demand process is compound generalized Erlang
573 -- 580Andre Costa, Owen Dafydd Jones, Dirk P. Kroese. Convergence properties of the cross-entropy method for discrete optimization
581 -- 583Karl Sigman, Uri Yechiali. Stationary remaining service time conditional on queue length
584 -- 590Erik M. M. Winands. On polling systems with large setups
591 -- 594Moshe Haviv, Jan van der Wal. Waiting times in queues with relative priorities
595 -- 600Wen-Yuan Liu, Xiu-li Xu, Naishuo Tian. Stochastic decompositions in the M/M/1 queue with working vacations
601 -- 611P. R. Parthasarathy, R. Sudhesh. Time-dependent analysis of a single-server retrial queue with state-dependent rates
612 -- 618Tatsiana Levina, Yuri Levin, Jeff McGill, Mikhail Nediak. Linear programming with online learning
619 -- 626Ronald Ortner. Linear dependence of stationary distributions in ergodic Markov decision processes
627 -- 635Dashan Huang, Frank J. Fabozzi, Masao Fukushima. Robust portfolio selection with uncertain exit time using worst-case VaR strategy
636 -- 644M. Z. Arslanov. A polynomial algorithm for one problem of guillotine cutting
645 -- 650Miguel Constantino, Luis Gouveia. Reformulation by discretization: Application to economic lot sizing
651 -- 659Russell D. Meller, Weiping Chen, Hanif D. Sherali. Applying the sequence-pair representation to optimal facility layout designs
660 -- 668Louis-Martin Rousseau, Michel Gendreau, Dominique Feillet. Interior point stabilization for column generation
669 -- 676Boray Huang, Seyed M. R. Iravani. Optimal production and rationing decisions in supply chains with information sharing
677 -- 684Jérôme Monnot, Sophie Toulouse. The path partition problem and related problems in bipartite graphs
685 -- 692Stavros G. Kolliopoulos, George Steiner. Approximation algorithms for scheduling problems with a modified total weighted tardiness objective

Volume 35, Issue 4

421 -- 426Moshe Haviv, Tim Roughgarden. The price of anarchy in an exponential multi-server
427 -- 433Jens Vygen. From stars to comets: Improved local search for universal facility location
434 -- 438Hyeong Soo Chang. A policy improvement method for constrained average Markov decision processes
439 -- 447Tûba Aktaran-Kalayci, David Goldsman, James R. Wilson. Linear combinations of overlapping variance estimators for simulation
448 -- 454Thomas Fung, Eugene Seneta. Tailweight, quantiles and kurtosis: A study of competing distributions
455 -- 462Bruno Gaujal, Landy Rabehasaina. Open-loop control of stochastic fluid systems and applications
463 -- 466Michael Shalmon. Explicit formulas for the variance of conditioned sojourn times in M/D/1-PS
467 -- 471Felix Papier, Ronald W. Wolff, Ulrich W. Thonemann. On the convexity of loss probabilities when arrivals occur in batches and servers are heterogeneous
472 -- 476Ho Woo Lee, Won Joo Seo. A mean value formula for the M/G/1 queues controlled by workload
477 -- 484O. Zeynep Aksin, Fikri Karaesmen. Characterizing the performance of process flexibility structures
485 -- 492Irwin E. Schochetman, Robert L. Smith. Infinite horizon optimality criteria for equipment replacement under technological change
493 -- 502A. A. Kranenburg, G. J. van Houtum. Cost optimization in the (S-1, S) lost sales inventory model with multiple demand classes
503 -- 509Jiang Zhang, Jun Zhang. Fill rate of single-stage general periodic review inventory systems
510 -- 518Warren P. Adams, Richard J. Forrester. Linear forms of nonlinear expressions: New insights on old ideas
519 -- 524Sergiy Butenko, Svyatoslav Trukhanov. Using critical sets to solve the maximum independent set problem
525 -- 532Adam Kasperski, Pawel Zielinski. On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
533 -- 540Alexander A. Ageev, Alexei E. Baburin. Approximation algorithms for UET scheduling problems with exact delays
541 -- 548Chung-Yee Lee, Gang Yu. Single machine scheduling under potential disruption
549 -- 557F. Zeynep Sargut, H. Edwin Romeijn. Lot-sizing with non-stationary cumulative capacities
558 -- 559René Henrion. Book review
559 -- 560Franz Rendl. Andrzej Ruszczynski, Nonlinear Optimization, Princeton University Press, Princeton, NJ, 2006, ISBN 0-691-11915-5, 464 pp., 59.50

Volume 35, Issue 3

281 -- 289Guillermo Gallego, Kaan Katircioglu, Bala Ramachandran. Inventory management under highly uncertain demand
290 -- 296Shieu-Hong Lin, Nate Gertsch, Jennifer R. Russell. A linear-time algorithm for finding optimal vehicle refueling policies
297 -- 307Hans van den Berg, Michel Mandjes, Rudesindo Núñez-Queija. Pricing and distributed QoS control for elastic network traffic
308 -- 310Kyung C. Chae, Kilhwan Kim, Nam K. Kim. Remarks on the remaining service time upon reaching a target level in the M/G/1 queue
311 -- 318Hanoch Levy, David Raz, Benjamin Avi-Itzhak. Locality of reference and the use of sojourn time variance for measuring queue unfairness
319 -- 323John N. Tsitsiklis. NP-Hardness of checking the unichain condition in average cost MDPs
324 -- 330J. Cole Smith, Churlzu Lim, J. Neil Bearden. On the multi-attribute stopping problem with general value functions
331 -- 335Rainer E. Burkard, Jafar Fathali, Hossein Taghizadeh Kakhki. The p-maxian problem on a tree
336 -- 344Horst W. Hamacher, Christian Roed Pedersen, Stefan Ruzika. Finding representative systems for discrete bicriterion optimization problems
345 -- 352Gautam Appa, Balázs Kotnyek, Konstantinos Papalamprou, Leonidas S. Pitsoulis. Optimization with binet matrices
353 -- 356Giacomo Zambelli. Colorings of k-balanced matrices and integer decomposition property of related polyhedra
357 -- 364François Clautiaux, Jacques Carlier, Aziz Moukrim. A new exact method for the two-dimensional bin-packing problem with fixed orientation
365 -- 373François Clautiaux, Antoine Jouglet, Joseph El Hayek. A new lower bound for the non-oriented two-dimensional bin-packing problem
374 -- 378Herbert F. Lewis, Thomas R. Sexton. On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem
379 -- 384Jaroslaw Byrka, Karen Aardal. The approximation gap for the metric facility location problem is not yet closed
385 -- 391András Frank, Zoltán Király, Balázs Kotnyek. An algorithm for node-capacitated ring routing
392 -- 402Mourad Baïou, Michel Balinski. Characterizations of the optimal stable allocation mechanism
403 -- 408Federico Della Croce, M. J. Kaminski, Vangelis Th. Paschos. An exact algorithm for MAX-CUT in sparse graphs
409 -- 415Yun-Bin Zhao, Jie Hu. Global bounds for the distance to solutions of co-coercive variational inequalities
416 -- 418Stephen C. Graves. Book review
418 -- 419Thomas Wilhelm Erlebach. Tim Roughgarden, Selfish Routing and the Price of Anarchy, MIT Press, Cambridge, MA (2005) ISBN 0-262-18243-2, pp 196
419 -- 420Diethard Klatte. Jan Brinkhuis and Vladimir Tikhomirov, Editors, Optimization: Insights and Applications, Princeton University Press, Princeton, NJ (2005) ISBN 0-691-10287-2, pp 676

Volume 35, Issue 2

141 -- 150Lázaro Cánovas, Sergio García, Martine Labbé, Alfredo Marín. A strengthened formulation for the simple plant location problem with order
151 -- 154Lina Mallozzi. Noncooperative facility location games
155 -- 158Shao Chin Sung, Dinko Dimitrov. On core membership testing for hedonic coalition formation games
159 -- 164Francisco Facchinei, Andreas Fischer, Veronica Piccialli. On generalized Nash games and variational inequalities
165 -- 171Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki. Duality in option pricing based on prices of other derivatives
172 -- 180H. Edwin Romeijn, Joseph Geunes, Kevin Taaffe. On a nonseparable convex maximization problem with continuous knapsack constraints
181 -- 185Antonio Frangioni, Claudio Gentile. SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
186 -- 194Z.-L. Chen, L. Lei, H. Zhong. Container vessel scheduling with bi-directional flows
195 -- 200Cédric Bentz. The maximum integer multiterminal flow problem in directed graphs
201 -- 204David Avis, Tomokazu Imamura. A list heuristic for vertex cover
205 -- 210Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos. Improved worst-case complexity for the MIN 3-SET COVERING problem
211 -- 220Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao. Complexity of two dual criteria scheduling problems
221 -- 226Philippe Mahey, Mauricio C. de Souza. Local optimality conditions for multicommodity flow problems with separable piecewise convex costs
227 -- 231Wojciech Bozejko, Mieczyslaw Wodecki. On the theoretical properties of swap multimoves
232 -- 234Robert Lin, Wayne T. Chouhuang, Gino K. Yang, Cheng-Tan Tung. An improved algorithm for the minimax distribution-free inventory model with incident-oriented shortage costs
235 -- 244Tal Ben-Zvi, Abraham Grosfeld-Nir. Serial production systems with random yield and rigid demand: A heuristic
245 -- 250Natali Hritonenko, Yuri Yatsenko. Optimal equipment replacement without paradoxes: A continuous analysis
251 -- 260Achal Bassamboo, Sandeep Juneja, Assaf J. Zeevi. On the inefficiency of state-independent importance sampling in the presence of heavy tails
261 -- 266C. Daoui, Mohammed Abbad. On some algorithms for limiting average Markov decision processes
267 -- 272Katerina P. Papadaki, Warren B. Powell. Monotonicity in multidimensional Markov decision processes for the batch dispatch problem
273 -- 280U. C. Gupta, A. D. Banik. Complete analysis of finite and infinite buffer GI/MSP/1 queue - A computational approach

Volume 35, Issue 1

1 -- 9Carlo Mannino, Gianpaolo Oriolo, Federico Ricci, L. Sunil Chandran. The stable set problem and the thinness of a graph
10 -- 16Thành Nguyen. On the disjoint paths problem
17 -- 22Martha Salazar-Neumann. The robust minimum spanning tree problem: Compact and convex uncertainty
23 -- 28Xiaoguang Yang, Jianzhong Zhang. Partial inverse assignment problems under l::1:: norm
29 -- 35Juan Pablo Vielma. A constructive characterization of the split closure of a mixed integer linear program
36 -- 44Vicky Mak. Iterative variable aggregation and disaggregation in IP: An application
45 -- 53Alberto Amaya, André Langevin, Martin Trépanier. The capacitated arc routing problem with refill points
54 -- 60D. P. Wang. Computing a maxian point of a simple rectilinear polygon
61 -- 68Tamás Kis, Richárd Kápolnai. Approximations and auctions for scheduling batches on related machines
69 -- 73Eric Angel, Evripidis Bampis, Aleksei V. Fishkin. A note on scheduling to meet two min-sum objectives
74 -- 82Che-Lin Su. Analysis on the forward market equilibrium model
83 -- 94Yasemin Serin. Competitive newsvendor problems with the same Nash and Stackelberg solutions
95 -- 104Keli Feng, Uday S. Rao. Echelon-stock (R, nT) control in two-stage serial stochastic inventory systems
105 -- 113Maria Vlasiou, Ivo J. B. F. Adan. Exact solution to a Lindley-type equation on a bounded support
114 -- 118Kyung C. Chae, Sung J. Kim. Busy period analysis for the GI/M/1 queue with exponential vacations
119 -- 124Hideaki Takagi, Ramón M. Rodríguez-Dagnino. Counting the number of renewals during a random interval in a discrete-time delayed renewal process
125 -- 138Barbara Haas Margolius. Periodic solution to the time-inhomogeneous multi-server Poisson queue
139 -- 140Philippe Baptiste. Book review