A branch‐and‐price algorithm for the capacitated p‐median problem

DOI10.1002/NET.20059zbMATH Open1101.68722OpenAlexW2327321413MaRDI QIDQ4680415FDOQ4680415

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

Recommendations

• Two exact algorithms for the capacitated \(p\)-median problem
• A branch-and-price approach to \(p\)-median location problems
• An efficient heuristic algorithm for the capacitated \(p\)-median problem
• A column generation approach to capacitated \(p\)-median problems
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes

zbMATH Keywords

integer programmingcolumn generationbranch-and-pricep-median

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)

Cited In (25)

• A cutting plane method for knapsack polytope
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
• The capacitated mobile facility location problem
• Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning
• The most probable allocation solution for the p-median problem
• Model-based capacitated clustering with posterior regularization
• A column generation approach to capacitated \(p\)-median problems
• 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
• Mathematical Models and Search Algorithms for the Capacitated p-Center Problem
• A Survey of the Generalized Assignment Problem and Its Applications
• Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
• A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem
• 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
• Lagrangean duals and exact solution to the capacitated \(p\)-center problem
• A matheuristic for large-scale capacitated clustering
• A cut-and-solve based algorithm for the single-source capacitated facility location problem
• A computational study of exact knapsack separation for the generalized assignment problem
• A computational evaluation of a general branch-and-price framework for capacitated network location problems
• Primal and dual bounds for the vertex \(p\)-median problem with balance constraints
• A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
• Two exact algorithms for the capacitated \(p\)-median problem
• A branch-and-price approach to \(p\)-median location problems
• An improved cut-and-solve algorithm for the single-source capacitated facility location problem
• An efficient heuristic algorithm for the capacitated \(p\)-median problem

This page was built for publication: A branch‐and‐price algorithm for the capacitated p‐median problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680415)