Two exact algorithms for the capacitated \(p\)-median problem
From MaRDI portal
Publication:1421050
zbMath1109.90054MaRDI QIDQ1421050
Publication date: 19 February 2004
Published in: 4OR (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items (14)
Linearization technique with superior expressions for centralized planning problem with discount policy ⋮ An implementation of exact knapsack separation ⋮ A cutting plane method for knapsack polytope ⋮ An efficient heuristic algorithm for the capacitated \(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 ⋮ Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning ⋮ Solving the swath segment selection problem through Lagrangean relaxation ⋮ Using dual feasible functions to construct fast lower bounds for routing and location problems ⋮ 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 ⋮ Model-based capacitated clustering with posterior regularization ⋮ A computational evaluation of a general branch-and-price framework for capacitated network location problems ⋮ A branch-and-price algorithm for the two-dimensional level strip packing problem
Uses Software
This page was built for publication: Two exact algorithms for the capacitated \(p\)-median problem
