Volume 151, Number 1, November 2003

• 
  Gianpaolo Ghiani, Francesca Guerriero, Gilbert Laporte, Roberto Musmanno: Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. 1-11
• 
  Z. Kevin Weng, Tim McClurg: Coordinated ordering decisions for short life cycle products with uncertainty in delivery time and demand. 12-24
• 
  Moritz Fleischmann, Roelof Kuik: On optimal inventory control with independent stochastic item returns. 25-37
• 
  Dimitrios Vlachos, Rommert Dekker: Return handling options and order quantities for single period products. 38-52
• 
  Alan Olinsky, Shaw Chen, Lisa Harlow: The comparative efficacy of imputation methods for missing data in structural equation modeling. 53-79
• 
  Fengbo Shi: An optimal hostage rescue problem. 80-102
• 
  Janusz Granat, Francesca Guerriero: The interactive analysis of the multicriteria shortest path problem by the reference point method. 103-118
• 
  Matthias Ehrgott, Dagmar Tenfelde-Podehl: Computation of ideal and Nadir values and implications for their use in MCDM methods. 119-139
• 
  William E. Stein, Darryl A. Seale, Amnon Rapoport: Analysis of heuristic solutions to the best choice problem. 140-152
• 
  Yuji Yoshida: A discrete-time model of American put option in an uncertain environment. 153-166
• 
  Hsien-Tang Tsai, Herbert Moskowitz, Lai-Hsi Lee: Human resource selection for software development projects using Taguchi's parameter design. 167-180
• 
  Nico Vandaele, Inneke Van Nieuwenhuyse, Sascha Cupers: Optimal grouping for a nuclear magnetic resonance scanner by means of an open queueing model. 181-192
• 
  Peter J. Ryan: Progressive option bounds from the sequence of concurrently expiring options. 193-223
• 
  Andreas Wagener: Comparative statics under uncertainty: The case of mean-variance preferences. 224-232
• 
  Tsuneshi Obata, Hiroaki Ishii: A method for discriminating efficient candidates with ranked voting data. 233-237
• 
  Maria A. Osorio, Manuel Laguna: Logic cuts for multilevel generalized assignment problems. 238-246

Volume 151, Number 2, December 2003

• 
  Alain Hertz, Marino Widmer: Guidelines for the use of meta-heuristics in combinatorial optimization. 247-252
• 
  Kenneth Sörensen, Gerrit K. Janssens: Data mining with genetic algorithms on binary trees. 253-264
• 
  Refael Hassin, Asaf Levin, Dana Morad: Lexicographic local search and the p. 265-279
• 
  Bernard Fortz, Patrick Soriano, Christelle Wynants: A tabu search algorithm for self-healing ring network design. 280-295
• 
  Marc Sevaux, Stéphane Dauzère-Pérès: Genetic algorithms to minimize the weighted number of late jobs on a single machine. 296-306
• 
  Tamás Kis: Job-shop scheduling with processing alternatives. 307-332
• 
  Maria João Cortinhal, M. Eugénia V. Captivo: Upper and lower bounds for the single source capacitated location problem. 333-351
• 
  Andrzej Jaszkiewicz, Pawel Kominek: Genetic local search with distance preserving recombination operator for a vehicle routing problem. 352-364
• 
  José A. Moreno-Pérez, J. Marcos Moreno-Vega, Inmaculada Rodríguez Martín: Variable neighborhood tabu search and its application to the median cycle problem. 365-378
• 
  Cédric Avanthay, Alain Hertz, Nicolas Zufferey: A variable neighborhood search for graph coloring. 379-388
• 
  Nenad Mladenovic, J. Petrovic, Vera Kovacevic-Vujcic, Mirjana Cangalovic: Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. 389-399
• 
  Andreas Fink, Stefan Voß: Solving the continuous flow-shop scheduling problem by metaheuristics. 400-414
• 
  Michel Gourgand, Nathalie Grangeon, Sylvie Norre: A contribution to the stochastic flow shop scheduling problem. 415-433
• 
  Ana R. Xambre, Pedro M. Vilarinho: A simulated annealing approach for manufacturing cell formation with multiple identical machines. 434-446

Volume 151, Number 3, December 2003

• 
  Brenda Cheang, H. Li, Andrew Lim, Brian Rodrigues: Nurse rostering problems - a bibliographic survey. 447-460
• 
  Torbjörn Larsson, Michael Patriksson, Ann-Brith Strömberg: On the convergence of conditional epsilon-subgradient methods for convex programs and convex-concave saddle-point problems. 461-473
• 
  Oded Berman, Dmitry Krass, Zvi Drezner: The gradual covering decay location problem on a network. 474-480
• 
  Anurag Agarwal, Hasan Pirkul, Varghese S. Jacob: Augmented neural networks for task scheduling. 481-502
• 
  Antonio Alonso-Ayuso, Laureano F. Escudero, M. Teresa Ortuño: BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0-1 programs. 503-519
• 
  Manfred Gronalt, Richard F. Hartl, Marc Reimann: New savings based algorithms for time constrained pickup and delivery of full truckloads. 520-535
• 
  B. Mahadevan, David F. Pyke, Moritz Fleischmann: Periodic review, push inventory policies for remanufacturing. 536-551
• 
  Rogelio Oliva: Model calibration as a testing strategy for system dynamics models. 552-568
• 
  José A. Gómez-Limón, Manuel Arriaza, Laura Riesgo: An MCDM analysis of agricultural risk aversion. 569-585
• 
  Halit Üster, Robert F. Love: Formulation of confidence intervals for estimated actual distances. 586-601
• 
  Karl Frauendorfer, Michael Schürle: Management of non-maturing deposits by multistage stochastic programming. 602-616
• 
  Jan Annaert, Julien van den Broeck, Rudi Vander Vennet: Determinants of mutual fund underperformance: A Bayesian stochastic frontier approach. 617-632

last updated on Sat May 18 06:06:57 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page