| 649 | -- | 650 | S. Arifusalem, Stefano Benati, Brian Boffey, Teresa Cáceres, Dietmar Cieslik, Zvi Drezner, Horst A. Eiselt, Ioannis Giannikos, Horst W. Hamacher, John M. Hodgson, Jörg Kalcsics, Kathrin Klamroth, Olivier Klopfenstein, Mercedes Landete, Maria Cruz López de los Mozos Martin, Alfredo Marín, Juan A. Mesa, Malick Ndiaye, Stefan Nickel, Blas Pelegrín. New trends in locational analysis |
| 651 | -- | 660 | M. Cruz López-de-los-Mozos, Juan A. Mesa, Justo Puerto. A generalized model of equality measures in network location problems |
| 661 | -- | 682 | Éric Gourdin, Olivier Klopfenstein. Multi-period capacitated location with modular equipments |
| 683 | -- | 700 | Frank Plastria, Lieselot Vanhaverbeke. Discrete models for competitive location with foresight |
| 701 | -- | 716 | T. B. Boffey, Juan A. Mesa, Francisco A. Ortega, J. I. Rodrigues. Locating a low-level waste disposal site |
| 717 | -- | 736 | Zvi Drezner. Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem |
| 737 | -- | 749 | Blas Pelegrín, José Fernández, Boglárka Tóth. The 1-center problem in the plane with independent random weights |
| 750 | -- | 765 | Justo Puerto, Antonio M. Rodríguez-Chía. Quasiconvex constrained multicriteria continuous location problems: Structure of nondominated solution sets |
| 766 | -- | 775 | Stefano Benati. Categorical data fuzzy clustering: An analysis of local search heuristics |
| 776 | -- | 796 | Ye Chen, Kevin W. Li, D. Marc Kilgour, Keith W. Hipel. A case-based distance model for multiple criteria ABC analysis |
| 797 | -- | 806 | José Luis González Velarde, Rafael Martí. Adaptive memory programing for the robust capacitated international sourcing problem |
| 807 | -- | 813 | Mark Lewis, Gary A. Kochenberger, Bahram Alidaee. A new modeling and solution approach for the set-partitioning problem |
| 814 | -- | 826 | Hari K. Rajagopalan, Cem Saydam, Jing Xiao. A multiperiod set covering location model for dynamic redeployment of ambulances |
| 827 | -- | 844 | Imed Kacem, Chengbin Chu, Ahmed Souissi. Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times |
| 845 | -- | 853 | Chinyao Low, Chou-Jung Hsu, Chwen-Tzeng Su. A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines |
| 854 | -- | 862 | Roberto Cordone, Federico Gandellini, Giovanni Righini. Solving the swath segment selection problem through Lagrangean relaxation |
| 863 | -- | 875 | Sang-Oh Shim, Yeong-Dae Kim. A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property |
| 876 | -- | 883 | Dar-Li Yang, Chou-Jung Hsu, Wen-Hung Kuo. A two-machine flowshop scheduling problem with a separated maintenance constraint |
| 884 | -- | 892 | Yong-Gon Cho, Keun-Tae Cho. A loss function approach to group preference aggregation in the AHP |
| 893 | -- | 905 | Alexandre Dolgui, Maxim Pashkevich. On the performance of binomial and beta-binomial models of demand forecasting for multiple slow-moving inventory items |
| 906 | -- | 915 | Philippe Baptiste, Marta Flamini, Francis Sourd. Lagrangian bounds for just-in-time job-shop scheduling |
| 916 | -- | 932 | Silvio A. de Araujo, Marcos N. Arenales, Alistair R. Clark. Lot sizing and furnace scheduling in small foundries |
| 933 | -- | 943 | Deniz Türsel Eliiyi, Melih Özlen. A Lagrangean relaxation approach for the mixed-model flow line sequencing problem |
| 944 | -- | 959 | François Clautiaux, Antoine Jouglet, Jacques Carlier, Aziz Moukrim. A new constraint programming approach for the orthogonal packing problem |
| 960 | -- | 975 | Ivo Blöchliger, Nicolas Zufferey. A graph coloring heuristic using partial solutions and a reactive tabu scheme |
| 976 | -- | 993 | Reakook Hwang, Mitsuo Gen, Hiroshi Katayama. A comparison of multiprocessor task scheduling algorithms with communication costs |
| 994 | -- | 1002 | Peter Zörnig. A note on cycling LP examples with permutation structure |