| 309 | -- | 311 | Horst A. Eiselt, Samuel Ratick. Introduction |
| 312 | -- | 326 | Barbara Pfeiffer, Kathrin Klamroth. A unified model for Weber problems with continuous and network distances |
| 327 | -- | 338 | Lixun Zhang, Gerard Rushton. Optimizing the size and locations of facilities in competitive multi-site service systems |
| 339 | -- | 355 | Alan T. Murray, Morton E. O Kelly, Richard L. Church. Regional service coverage modeling |
| 356 | -- | 372 | Oded Berman, Rongbing Huang. The minimum weighted covering location problem with distance constraints |
| 373 | -- | 391 | Yolanda Hinojosa, Jörg Kalcsics, Stefan Nickel, Justo Puerto, Sebastian Velten. Dynamic supply chain design with inventory |
| 392 | -- | 403 | Oded Berman, Qian Wang. Locating a semi-obnoxious facility with expropriation |
| 404 | -- | 416 | Enrique Domínguez, José Muñoz. A neural model for the p-median problem |
| 417 | -- | 426 | Richard L. Church. BEAMR: An exact and approximate model for the p-median problem |
| 427 | -- | 435 | Charles S. Revelle, Michelle Scholssberg, Justin Williams. Solving the maximal covering location problem with heuristic concentration |
| 436 | -- | 444 | Giuseppe Bruno, Gennaro Improta. Using gravity models for the evaluation of new university site locations: A case study |
| 445 | -- | 456 | Bilal Farhan, Alan T. Murray. Siting park-and-ride facilities using a multi-objective spatial optimization model |
| 457 | -- | 474 | Ronald K. Klimberg, Samuel J. Ratick. Modeling data envelopment analysis (DEA) efficient location/allocation decisions |
| 475 | -- | 487 | Vladimir Marianov, Charles S. Revelle, Stephanie Snyder. Selecting compact habitat reserves for species with differential habitat size needs |
| 488 | -- | 498 | Justin C. Williams. Optimal reserve site selection with distance requirements |
| 499 | -- | 512 | Rex K. Kincaid, Catherine Easterling, Meagan Jeske. Computational experiments with heuristics for two nature reserve site selection problems |
| 513 | -- | 524 | Horst A. Eiselt, Vladimir Marianov. Employee positioning and workload allocation |
| 525 | -- | 537 | Alix Munier Kordon, Djamal Rebaine. Polynomial time algorithms for the UET permutation flowshop problem with time delays |
| 538 | -- | 556 | Marc Peeters, Leo G. Kroon. Circulation of railway rolling stock: a branch-and-price approach |
| 557 | -- | 573 | Dritan Nace, Nhat Linh Doan, Olivier Klopfenstein, Alfred Bashllari. Max-min fairness in multi-commodity flows |
| 574 | -- | 599 | Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner. Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date |
| 600 | -- | 613 | Luis Gouveia, Ana Paias, Dushyant Sharma. Modeling and solving the rooted distance-constrained minimum spanning tree problem |
| 614 | -- | 627 | Satyaveer Singh Chauhan, Alain Martel, Sophie D Amours. Roll assortment optimization in a paper mill: An integer programming approach |
| 628 | -- | 637 | Boris Bontoux, Dominique Feillet. Ant colony optimization for the traveling purchaser problem |
| 638 | -- | 647 | Adam N. Letchford, Nicholas A. Pearson. Good triangulations yield good tours |