Multiobjective solution of the uncapacitated plant location problem
From MaRDI portal
Publication:1869487
DOI10.1016/S0377-2217(02)00223-0zbMath1011.90034WikidataQ58217324 ScholiaQ58217324MaRDI QIDQ1869487
Publication date: 10 April 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Dynamic programming (90C39) Discrete location and assignment (90B80)
Related Items (11)
A bi-objective approach to discrete cost-bottleneck location problems ⋮ Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example ⋮ Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia ⋮ The multiscenario lot size problem with concave costs. ⋮ Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets ⋮ A new complexity result on multiobjective linear integer programming using short rational generating functions ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ Facility location models for distribution system design ⋮ Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network ⋮ Multiple criteria facility location problems: a survey ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of practical interactive branch and bound algorithms for multicriteria integer programming
- Zero-one programming with multiple criteria
- A multicriteria approach to the location of public facilities
- An algorithm for the multiple objective integer linear programming problem
- Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
- Multicriteria planar location problems
- Efficiency in Euclidean constrained location problems
- Robust discrete optimization and its applications
- The simple plant location problem: Survey and synthesis
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Efficient solution of large scale, single-source, capacitated plant location problems
- A Survey of Multiple Criteria Integer Programming Methods
- Linear parametric programming—A brief survey
- Determination of efficient points in multiple-objective location problems
- A Dual-Based Procedure for Uncapacitated Facility Location
- Identifying Efficient Vectors: Some Theory and Computational Results
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- Multicriteria network location problems with sum objectives
- Multi‐objective combinatorial optimization problems: A survey
- Location Theory, Dominance, and Convexity
- Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
This page was built for publication: Multiobjective solution of the uncapacitated plant location problem
