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

Volume 36, Number 4, July 2008

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

Volume 36, Number 5, September 2008

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

Volume 36, Number 6, November 2008

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