A branch‐and‐price algorithm for the capacitated p‐median problem
From MaRDI portal
Publication:4680415
DOI10.1002/net.20059zbMath1101.68722OpenAlexW2327321413MaRDI QIDQ4680415
Alberto Ceselli, Giovanni Righini
Publication date: 1 June 2005
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20059
Integer programming (90C10) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)
Related Items
An implementation of exact knapsack separation ⋮ Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent ⋮ A cutting plane method for knapsack polytope ⋮ A matheuristic for large-scale capacitated clustering ⋮ An efficient heuristic algorithm for the capacitated \(p\)-median problem ⋮ A cut-and-solve based algorithm for the single-source capacitated facility location problem ⋮ The most probable allocation solution for the p-median problem ⋮ Primal and dual bounds for the vertex \(p\)-median problem with balance constraints ⋮ Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems ⋮ A Survey of the Generalized Assignment Problem and Its Applications ⋮ Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning ⋮ The capacitated mobile facility location problem ⋮ An improved cut-and-solve algorithm for the single-source capacitated facility location problem ⋮ A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes ⋮ A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem ⋮ A computational study of exact knapsack separation for the generalized assignment problem ⋮ A branch-and-price approach to \(p\)-median location problems ⋮ Model-based capacitated clustering with posterior regularization ⋮ Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem ⋮ Mathematical Models and Search Algorithms for the Capacitated p-Center Problem ⋮ A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem ⋮ A computational evaluation of a general branch-and-price framework for capacitated network location problems ⋮ Lagrangean duals and exact solution to the capacitated \(p\)-center problem
Cites Work
This page was built for publication: A branch‐and‐price algorithm for the capacitated p‐median problem
