Mathematical Models and Search Algorithms for the Capacitated p-Center Problem

DOI10.1287/ijoc.2019.0889zbMath1451.90087arXiv1803.04865OpenAlexW2979694257MaRDI QIDQ3386776

Raphael Kramer, Manuel Iori, Thibaut Vidal

Publication date: 7 January 2021

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.04865

zbMATH Keywords

valid inequalitiessearch algorithmsmathematical modelscapacitated \(p\)-center

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (5)

An exact framework for the discrete parallel machine scheduling location problem ⋮ The multi-period \(p\)-center problem with time-dependent travel times ⋮ Dynamically second-preferred \(p\)-center problem ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Capacitated \(p\)-center problem with failure foresight
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• An implementation of exact knapsack separation
• Double bound method for solving the \(p\)-center location problem
• Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent
• Bee colony optimization for the \(p\)-center problem
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
• Lagrangean duals and exact solution to the capacitated \(p\)-center problem
• A heuristic for the p-center problem in graphs
• A column generation approach to capacitated \(p\)-median problems
• LP models for bin packing and cutting stock problems
• Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
• Formulations and valid inequalities for the heterogeneous vehicle routing problem
• An exact algorithm for the capacitated vertex \(p\)-center problem
• A New Formulation and Resolution Method for the p-Center Problem
• Solving Large p-Median Problems with a Radius Formulation
• Solution methods for thep-median problem: An annotated bibliography
• A Best Possible Heuristic for the k-Center Problem
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Disjunctive Programming
• Generating Fenchel Cutting Planes for Knapsack Polyhedra
• Fenchel Cutting Planes for Integer Programs
• 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
• A Branch Decomposition Algorithm for the p-Median Problem
• A branch‐and‐price algorithm for the capacitated p‐median problem
• New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
• Location Science
• The m-Center Problem
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Mathematical Models and Search Algorithms for the Capacitated p-Center Problem