Solving a bicriteria problem of optimal service centers location

DOI10.1007/S10852-012-9203-7MaRDI QIDQ367241zbMATHOpenAlexWikidataFDO

Authors A. A. Kolokolov, L. A. Zaozerskaya

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

zbMATH Keywords

graphsinteger programminglocation problemmultiple-criterion optimization\(L\)-class enumeration algorithmservice centertrade offs

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Integer programming (90C10) Discrete location and assignment (90B80)

Recommendations

• Locating service centers with precedence constraints
• Solving the competitive discretionary service facility location problem
• scientific article; zbMATH DE number 591341
• Locating and staffing service centers under service level constraints
• The multiple server center location problem
• A Benders decomposition algorithm for the maximum availability service facility location problem

Cites work

• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• scientific article; zbMATH DE number 1487885 (Why is no real title available?)
• scientific article; zbMATH DE number 803941 (Why is no real title available?)
• A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
• A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
• A genetic algorithm for the set covering problem
• A parallel genetic algorithm to solve the set-covering problem
• Algorithms for the set covering problem
• An exact algorithm for the maximum stable set problem
• Complexity of discrete multicriteria problems
• Computational experience with approximation algorithms for the set covering problem
• Enhancing an algorithm for set covering problems
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• The set covering problem: Complexity, algorithms, experiments

Cited in

(11)

• The multicriteria \(p\)-facility median location problem on networks
• Particular structures of the Pareto set and its reduction in bicriteria discrete problems
• Allocation of service centers in the GIS with the largest vitality degree
• The reduction of the Pareto set of a special structure in bicriteria discrete problems
• The probabilistic \(p\)-center problem: planning service for potential customers
• scientific article; zbMATH DE number 2044633 (Why is no real title available?)
• Threshold robustness in discrete facility location problems: a bi-objective approach
• A bicriterion call center problem through an evolved branch and bound algorithm
• Dynamic location problems with radial structure of the components of the connecting graph
• Design and optimization for a service network with multiple service centers
• A modular capacitated multi-objective model for locating maritime search and rescue vessels

This page was built for publication: Solving a bicriteria problem of optimal service centers location

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367241)