Title Page/Editorial Board
Introduction
A unified model for Weber problems with continuous and network distances
Optimizing the size and locations of facilities in competitive multi-site service systems
Regional service coverage modeling
The minimum weighted covering location problem with distance constraints
Dynamic supply chain design with inventory
Locating a semi-obnoxious facility with expropriation
A neural model for the p-median problem
BEAMR: An exact and approximate model for the p-median problem
Solving the maximal covering location problem with heuristic concentration
Using gravity models for the evaluation of new university site locations: A case study
Siting park-and-ride facilities using a multi-objective spatial optimization model
Modeling data envelopment analysis (DEA) efficient location/allocation decisions
Selecting compact habitat reserves for species with differential habitat size needs
Optimal reserve site selection with distance requirements
Computational experiments with heuristics for two nature reserve site selection problems
Employee positioning and workload allocation
Polynomial time algorithms for the UET permutation flowshop problem with time delays
Circulation of railway rolling stock: a branch-and-price approach
Max–min fairness in multi-commodity flows
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
Modeling and solving the rooted distance-constrained minimum spanning tree problem
Roll assortment optimization in a paper mill: An integer programming approach
Ant colony optimization for the traveling purchaser problem
Good triangulations yield good tours
