An exact algorithm for the capacitated vertex \(p\)-center problem

DOI10.1016/j.cor.2004.09.035zbMath1126.90039OpenAlexW2165563862MaRDI QIDQ2496034

F. Aykut Özsoy, Mustafa Çelebi Pinar

Publication date: 30 June 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/23804

zbMATH Keywords

integer programmingfacility locationcapacitated \(p\)-center problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (14)

A scalable exact algorithm for the vertex \(p\)-center problem ⋮ Tabu search for the real-world carpooling problem ⋮ Capacitated \(p\)-center problem with failure foresight ⋮ Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent ⋮ When centers can fail: a close second opportunity ⋮ A comprehensive modeling framework for hazmat network design, hazmat response team location, and equity of risk ⋮ Efficient sensor network management for asset localization ⋮ Dynamically second-preferred \(p\)-center problem ⋮ \(k\)-balanced center location problem: a new multi-objective facility location problem ⋮ The stratified \(p\)-center problem ⋮ A dual bounding scheme for a territory design problem ⋮ Mathematical Models and Search Algorithms for the Capacitated p-Center Problem ⋮ The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique ⋮ Lagrangean duals and exact solution to the capacitated \(p\)-center problem

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• A note on solving large p-median problems
• A column generation approach to capacitated \(p\)-median problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• How to Allocate Network Centers
• Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• Large-scale local search heuristics for the capacitated vertexp-center problem
• The Capacitated K-Center Problem

This page was built for publication: An exact algorithm for the capacitated vertex \(p\)-center problem