European Journal of Operational Research, Volume 169

Volume 169, Number 1, February 2006

• Omkarprasad S. Vaidya, Sushil Kumar:
  Analytic hierarchy process: An overview of applications. 1-29
  
• Yaodong Cui:
  Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors. 30-40
  
• Peter Korteweg, Ton Volgenant:
  On the Hierarchical Chinese Postman Problem with linear ordered classes. 41-52
  
• Saral Mukherjee, A. K. Chatterjee:
  The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price. 53-64
  
• Hung-Chi Chang, Jing-Shing Yao, Liang-Yuh Ouyang:
  Fuzzy mixture inventory model involving fuzzy random variable lead time demand and fuzzy total demand. 65-80
  
• Julien Mostard, Ruud H. Teunter:
  The newsboy problem with resalable returns: A single period model and case study. 81-96
  
• Dong Cao, Mingyuan Chen:
  Capacitated plant selection in a decentralized manufacturing environment: A bilevel optimization approach. 97-110
  
• Roger M. Hill, Søren Glud Johansen:
  Optimal and near-optimal policies for lost sales inventory models with at most one replenishment order outstanding. 111-132
  
• Kwang-Jae Kim, Dennis K. J. Lin:
  Optimization of multiple responses considering both location and dispersion effects. 133-145
  
• Paul R. Harper, David J. Winslett:
  Classification trees: A possible method for maternity risk grouping. 146-156
  
• P. Szwed, J. René van Dorp, Jason R. W. Merrick, Thomas A. Mazzuchi, Amita Singh:
  A Bayesian paired comparison approach for relative accident probability assessment with covariate information. 157-177
  
• Rafael Pérez-Ocón, Delia Montoro-Cazorla:
  A multiple warm standby system with operational and repair times following phase-type distributions. 178-188
  
• Ruiqing Zhao, Wansheng Tang, Huaili Yun:
  Random fuzzy renewal process. 189-201
  
• Yonit Barron, Esther Frostig, Benny Levikson:
  Analysis of R. 202-225
  
• Thomas D. Nielsen, Jean-Yves Jaffray:
  Dynamic decision making without expected utility: An operational approach. 226-246
  
• Toshiyuki Sueyoshi:
  DEA-Discriminant Analysis: Methodological comparison among eight discriminant analysis approaches. 247-272
  
• John A. Aloysius, Fred D. Davis, Darryl D. Wilson, A. Ross Taylor, Jeffrey E. Kottemann:
  User acceptance of multi-criteria decision support systems: The impact of preference elicitation techniques. 273-285
  
• Riza Demirer, Prakash P. Shenoy:
  Sequential valuation networks for asymmetric decision problems. 286-309
  
• Pu-yan Nie, Lihua Chen, Masao Fukushima:
  Dynamic programming approach to discrete time dynamic feedback Stackelberg games with independent and dependent followers. 310-328
  
• Shouhong Wang:
  Comments on operational competitiveness rating analysis (OCRA). 329-331
  
• Celik Parkan:
  On OCRA: Response to comments by Wang (2004). 332-337
  
• A. Volgenant:
  An addendum on sensitivity analysis of the optimal assignment. 338-339
  
• Diptesh Ghosh, Nilotpal Chakravarti, Gerard Sierksma:
  Sensitivity analysis of a greedy heuristic for knapsack problems. 340-350
  

Volume 169, Number 2, March 2006

• Rafael Martí:
  Scatter Search - Wellsprings and Challenges. 351-358
  
• Rafael Martí, Manuel Laguna, Fred Glover:
  Principles of scatter search. 359-372
  
• Carlos Gomes da Silva, João C. N. Clímaco, José Rui Figueira:
  A scatter search method for bi-criteria {0, 1}-knapsack problems. 373-391
  
• Ramón Sagarna, José Antonio Lozano:
  Scatter Search in software testing, comparison and collaboration with Estimation of Distribution Algorithms. 392-412
  
• G. Q. Zhang, K. K. Lai:
  Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem. 413-425
  
• Ricardo P. Beausoleil:
  "MOSS" multiobjective scatter search applied to non-linear multiple criteria optimization. 426-449
  
• Francisco Herrera, Manuel Lozano, Daniel Molina:
  Continuous scatter search: An analysis of the integration of some combination methods and improvement strategies. 450-476
  
• Félix García-López, Miguel García-Torres, Belén Melián-Batista, José A. Moreno-Pérez, J. Marcos Moreno-Vega:
  Solving feature subset selection problem by a Parallel Scatter Search. 477-489
  
• Belarmino Adenso-Díaz, Santiago García Carbajal, Sebastián Lozano:
  An empirical investigation on parallelization strategies for Scatter Search. 490-507
  
• Abdellah El-Fallahi, Rafael Martí, Leon S. Lasdon:
  Path relinking and GRG for artificial neural networks. 508-519
  
• Carlos Cotta:
  Scatter search with path relinking for phylogenetic inference. 520-532
  
• Stephan Scheuerer, Rolf Wendolsky:
  A scatter search heuristic for the capacitated clustering problem. 533-547
  
• Mutsunori Yagiura, Toshihide Ibaraki, Fred Glover:
  A path relinking approach with ejection chains for the generalized assignment problem. 548-569
  
• Juan A. Díaz, Elena Fernández:
  Hybrid scatter search and path relinking for the capacitated p. 570-585
  
• Feng Chu, Nacima Labadi, Christian Prins:
  A Scatter Search for the periodic capacitated arc routing problem. 586-605
  
• Robert A. Russell, Wen-Chyuan Chiang:
  Scatter search for the vehicle routing problem with time windows. 606-622
  
• Denise Sato Yamashita, Vinícius Amaral Armentano, Manuel Laguna:
  Scatter search for project scheduling with resource availability cost. 623-637
  
• Dieter Debels, Bert De Reyck, Roel Leus, Mario Vanhoucke:
  A hybrid scatter search/electromagnetism meta-heuristic for project scheduling. 638-653
  
• Eugeniusz Nowicki, Czeslaw Smutnicki:
  Some aspects of scatter search in the flow-shop problem. 654-666
  
• Hatem Ben Ameur, Michèle Breton, Pascal François:
  A dynamic programming approach to price installment options. 667-676
  
• Terje Lensberg, Aasmund Eilifsen, Thomas E. McKee:
  Bankruptcy theory development and classification via genetic programming. 677-697
  

Volume 169, Number 3, March 2006

• Jatinder N. D. Gupta, Edward F. Stafford:
  Flowshop scheduling research after five decades. 699-711
  
• Cyril Briand, Hoang Trung La, Jacques Erschler:
  A new sufficient condition of optimality for the two-machine flowshop problem. 712-722
  
• Saral Mukherjee, A. K. Chatterjee:
  Applying machine based decomposition in 2-machine flow shops. 723-741
  
• Pawel Jan Kalczynski, Jerzy Kamburowski:
  A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation. 742-750
  
• Victor Portougal, Dan Trietsch:
  Johnson's problem with stochastic processing times and optimal service level. 751-760
  
• Igor Averbakh:
  The minmax regret permutation flow-shop problem with two jobs. 761-766
  
• Ali Allahverdi, Fawaz S. Al-Anzi:
  A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times. 767-780
  
• Rubén Ruiz, Concepción Maroto:
  A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. 781-800
  
• Anurag Agarwal, Selcuk Colak, Enes Eryarsoy:
  Improvement heuristic for the flow-shop scheduling problem: An adaptive-learning approach. 801-815
  
• Tapan P. Bagchi, Jatinder N. D. Gupta, Chelliah Sriskandarajah:
  A review of TSP based approaches for flowshop scheduling. 816-854
  
• S. Martinez, Stéphane Dauzère-Pérès, C. Guéret, Yazid Mati, Nathalie Sauer:
  Complexity of flowshop scheduling problems with a new blocking constraint. 855-864
  
• Jatinder N. D. Gupta, Christos Koulamas, George J. Kyparisis:
  Performance guarantees for flowshop heuristics to minimize makespan. 865-872
  
• Andrzej Jaszkiewicz, Daniel Tuyttens:
  Metaheuristics in multiple objective optimization. 873-874
  
• Edmund K. Burke, J. D. Landa Silva:
  The influence of the fitness evaluation method on the performance of multiobjective search algorithms. 875-897
  
• Beatriz de la Iglesia, Graeme Richards, M. S. Philpott, Victor J. Rayward-Smith:
  The application and effectiveness of a multi-objective metaheuristic algorithm for partial classification. 898-917
  
• Sadan Kulturel-Konak, Alice E. Smith, Bryan A. Norman:
  Multi-objective tabu search using a multinomial probability mass function. 918-931
  
• Marco Laumanns, Lothar Thiele, Eckart Zitzler:
  An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method. 932-942
  
• Luis Paquete, Thomas Stützle:
  A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices. 943-959
  
• Tapio Tyni, Jari Ylinen:
  Evolutionary bi-objective optimisation in the elevator car routing problem. 960-977
  
• Jiefeng Xu, Milind G. Sohoni, Mike McCleery, T. Glenn Bailey:
  A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems. 978-993
  
• Nadine Meskens, Fouad Riane:
  Supply chain issues and opportunities. 994-995
  
• Marc Poulin, Benoît Montreuil, Alain Martel:
  Implications of personalization offers on demand and supply network design: A case from the golf club industry. 996-1009
  
• Axel Röder, Bernd Tibken:
  A methodology for modeling inter-company supply chains and for evaluating a method of integrated product and process documentation. 1010-1029
  
• Jacques Lamothe, Khaled Hadj-Hamou, Michel Aldanondo:
  An optimization model for selecting a product family and designing its supply chain. 1030-1047
  
• El Houssaine Aghezzaf, Birger Raa, Hendrik Van Landeghem:
  Modeling inventory routing problems in supply chains of high consumption products. 1048-1063
  
• Wing Yan Hung, Nouri J. Samsatli, Nilay Shah:
  Object-oriented dynamic supply-chain modelling incorporated with production scheduling. 1064-1076
  
• Bülent Karasözen, Mustafa Ç. Pinar, Tamás Terlaky, Gerhard-Wilhelm Weber:
  Feature Cluster "Advances in Continuous Optimization". 1077-1078
  
• Miguel A. Goberna, Margarita M. L. Rodriguez:
  Analyzing linear systems containing strict inequalities via evenly convex hulls. 1079-1095
  
• Mustafa Ç. Pinar, Wolfgang M. Hartmann:
  Huber approximation for the non-linear l. 1096-1107
  
• S. Ilker Birbil, Gemayqzel Bouza, J. B. G. Frenk, Georg J. Still:
  Equilibrium constrained optimization problems. 1108-1127
  
• M. U. Akhmet, M. Kirane, M. A. Tleubergenova, Gerhard-Wilhelm Weber:
  Control and optimal response problems for quasilinear impulsive integrodifferential equations. 1128-1147
  
• Domingos Moreira Cardoso, Luís Almeida Vieira:
  On the optimal parameter of a self-concordant barrier over a symmetric cone. 1148-1157
  
• Alireza Ghaffari Hadigheh, Tamás Terlaky:
  Sensitivity analysis in linear optimization: Invariant support set intervals. 1158-1175
  
• P. Kaelo, M. M. Ali:
  A numerical study of some modified differential evolution algorithms. 1176-1184
  
• Jürgen Guddat, Francisco Guerra Vázquez, Dieter Nowack, Jan-J. Rückmann:
  A modified standard embedding with jumps in nonlinear optimization. 1185-1206
  
• Leonid Faybusovich:
  Semidefinite descriptions of cones defining spectral mask constraints. 1207-1221
  

Last update Wed Feb 15 04:34:07 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page