Solving a bicriteria problem of optimal service centers location
DOI10.1007/s10852-012-9203-7zbMath1311.90077OpenAlexW1994144991WikidataQ57607351 ScholiaQ57607351MaRDI QIDQ367241
Lidia A. Zaozerskaya, Alexander A. Kolokolov
Publication date: 26 September 2013
Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-012-9203-7
integer programminglocation problemgraphsmultiple-criterion optimization\(L\)-class enumeration algorithmservice centertrade offs
Integer programming (90C10) Multi-objective and goal programming (90C29) Discrete location and assignment (90B80)
Related Items (5)
Cites Work
- A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
- Enhancing an algorithm for set covering problems
- A genetic algorithm for the set covering problem
- Computational experience with approximation algorithms for the set covering problem
- An exact algorithm for the maximum stable set problem
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- A parallel genetic algorithm to solve the set-covering problem
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- Complexity of discrete multicriteria problems
- Algorithms for the set covering problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Solving a bicriteria problem of optimal service centers location