A cut and branch approach for the capacitated p-median problem based on Fenchel cutting planes
From MaRDI portal
Publication:2481606
Recommendations
- Two exact algorithms for the capacitated p-median problem
- Solving capacitated facility location problems by Fenchel cutting planes
- A branch‐and‐price algorithm for the capacitated p‐median problem
- Computational study of large-scale \(p\)-median problems
- An efficient heuristic algorithm for the capacitated \(p\)-median problem
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1263271 (Why is no real title available?)
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A bionomic approach to the capacitated \(p\)-median problem
- A branch‐and‐price algorithm for the capacitated p‐median problem
- A column generation approach to capacitated \(p\)-median problems
- A new method for solving capacitated location problems based on a set partitioning approach
- Efficient algorithms for the capacitated concentrator location problem
- Fenchel Cutting Planes for Integer Programs
- Generating Fenchel Cutting Planes for Knapsack Polyhedra
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
- Modeling Facility Location Problems as Generalized Assignment Problems
- On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming
- Safe bounds in linear and mixed-integer linear programming
- Two exact algorithms for the capacitated \(p\)-median problem
Cited in
(20)- A branch‐and‐price algorithm for the capacitated p‐median problem
- Mathematical models and search algorithms for the capacitated \(p\)-center problem
- Two exact algorithms for the capacitated \(p\)-median problem
- A review of computation of mathematically rigorous bounds on optima of linear programs
- Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning
- Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS
- Primal and dual bounds for the vertex \(p\)-median problem with balance constraints
- A cutting plane method for knapsack polytope
- An exact column-generation approach for the lot-type design problem
- An efficient heuristic algorithm for the capacitated \(p\)-median problem
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem
- Discrete facility location in machine learning
- Model-based capacitated clustering with posterior regularization
- Integer set reduction for stochastic mixed-integer programming
- A matheuristic for large-scale capacitated clustering
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- Matheuristics for the capacitated p-Median problem
- An implementation of exact knapsack separation
- An effective hybrid approach to the two-stage capacitated facility location problem
- Semi-supervised \(k\)-means clustering via DC programming approach
This page was built for publication: A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481606)
