Efficient incrementing heuristics for generalized p-location problems

DOI10.1007/S10100-020-00722-5MaRDI QIDQ2051202zbMATH OpenOpenAlexFDO

Authors Jaroslav Janáček, Marek Kvet

Publication date 24 November 2021

Published in CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10100-020-00722-5

zbMATH Keywords

\(p\)-location problemgeneralized disutilityincrementing heuristicspath-relinking methoduniformly deployed set

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• scientific article; zbMATH DE number 1803756 (Why is no real title available?)
• scientific article; zbMATH DE number 1803757 (Why is no real title available?)
• Ambulance location and relocation models.
• An analysis of \(p\)-median location problem: effects of backup service level and demand assignment policy
• Computational study of large-scale \(p\)-median problems
• Discrete self-organizing migration algorithm and \(p\)-location problems
• Handbook of metaheuristics
• Improving emergency service in rural areas: a bi-objective covering location model for EMS systems
• Min-max optimization and the radial approach to the public service system design with generalized utility
• On Direct Methods for Lexicographic Min-Max Optimization
• Semi-fair design of emergency service system with failing centers
• Solving large \(p\)-median problems with a radius formulation
• The price of fairness

Cited in

(1)

• Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR

This page was built for publication: Efficient incrementing heuristics for generalized \(p\)-location problems

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