Solving a bicriteria problem of optimal service centers location

DOI10.1007/S10852-012-9203-7zbMATH Open1311.90077OpenAlexW1994144991WikidataQ57607351 ScholiaQ57607351MaRDI QIDQ367241FDOQ367241

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

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

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)

Cites Work

• Multiple criteria optimization: State of the art annotated bibliographic surveys
• A genetic algorithm for the set covering problem
• Title not available (Why is that?)
• Computational experience with approximation algorithms for the set covering problem
• Algorithms for the set covering problem
• 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
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
• An exact algorithm for the maximum stable set problem
• A parallel genetic algorithm to solve the set-covering problem
• The set covering problem: Complexity, algorithms, experiments
• Title not available (Why is that?)
• Complexity of discrete multicriteria problems
• Title not available (Why is that?)

Cited In (8)

• Dynamic location problems with radial structure of the components of the connecting graph
• A modular capacitated multi-objective model for locating maritime search and rescue vessels
• The probabilistic \(p\)-center problem: planning service for potential customers
• The reduction of the Pareto set of a special structure in bicriteria discrete problems
• Threshold robustness in discrete facility location problems: a bi-objective approach
• Particular Structures of the Pareto Set and Its Reduction in Bicriteria Discrete Problems
• Title not available (Why is that?)
• The multicriteria \(p\)-facility median location problem on networks

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)