Neighbourhood Reduction in Global and Combinatorial Optimization: The Case of the p-Centre Problem

Said Salhi () and Jack Brimberg ()
Additional contact information
Said Salhi: University of Kent
Jack Brimberg: The Royal Military College of Canada

Chapter Chapter 8 in Contributions to Location Analysis, 2019, pp 195-220 from Springer

Abstract: Abstract Neighbourhood reductions for a class of location problems known as the vertex (or discrete) and planar (or continuous) p-centre problems are presented. A brief review of these two forms of the p-centre problem is first provided followed by those respective reduction schemes that have shown to be promising. These reduction schemes have the power of transforming optimal or near optimal methods such as metaheuristics or relaxation-based procedures, which were considered relatively slow, into efficient and exciting ones that are now able to find optimal solutions or tight lower/upper bounds for larger instances. Research highlights of neighbourhood reduction for global and combinatorial optimisation problems in general and for related location problems in particular are also given.

Keywords: Neighbourhood reduction; p-centre problem; Continuous and discrete spaces; Heuristic search; Optimal methods (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-030-19111-5_8

Ordering information: This item can be ordered from
http://www.springer.com/9783030191115

DOI: 10.1007/978-3-030-19111-5_8

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().