Operations Research Letters, Volume 35

Volume 35, Number 1, January 2007

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

Volume 35, Number 2, March 2007

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