Journal: Oper. Res. Lett.

Volume 36, Issue 6

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

Volume 36, Issue 5

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

Volume 36, Issue 4

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

Volume 36, Issue 3

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

Volume 36, Issue 2

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

Volume 36, Issue 1

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