A cut and branch approach for the capacitated p-median problem based on Fenchel cutting planes
From MaRDI portal
Publication:2481606
DOI10.1007/S10852-007-9074-5zbMATH Open1170.90521OpenAlexW2018596236MaRDI QIDQ2481606FDOQ2481606
Authors: Claudio Sterle, Maurizio Boccia, Antonio Sforza, Igor' Leonidovich Vasilyev 
Publication date: 11 April 2008
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-007-9074-5
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
- A bionomic approach to the capacitated \(p\)-median problem
- Title not available (Why is that?)
- A column generation approach to capacitated \(p\)-median problems
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- Fenchel Cutting Planes for Integer Programs
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Efficient algorithms for the capacitated concentrator location problem
- Safe bounds in linear and mixed-integer linear programming
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
- Two exact algorithms for the capacitated \(p\)-median problem
- Title not available (Why is that?)
- Generating Fenchel Cutting Planes for Knapsack Polyhedra
- A branch‐and‐price algorithm for the capacitated p‐median problem
- On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming
- A new method for solving capacitated location problems based on a set partitioning approach
- Modeling Facility Location Problems as Generalized Assignment Problems
Cited In (20)
- A cutting plane method for knapsack polytope
- Mathematical models and search algorithms for the capacitated \(p\)-center problem
- Discrete facility location in machine learning
- Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning
- Integer set reduction for stochastic mixed-integer programming
- Model-based capacitated clustering with posterior regularization
- Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS
- Semi-supervised \(k\)-means clustering via DC programming approach
- Matheuristics for the capacitated p-Median problem
- A branch‐and‐price algorithm for the capacitated p‐median problem
- An implementation of exact knapsack separation
- A matheuristic for large-scale capacitated clustering
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- Primal and dual bounds for the vertex \(p\)-median problem with balance constraints
- A review of computation of mathematically rigorous bounds on optima of linear programs
- Two exact algorithms for the capacitated \(p\)-median problem
- An effective hybrid approach to the two-stage capacitated facility location problem
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem
- An exact column-generation approach for the lot-type design problem
- An efficient heuristic algorithm for the capacitated \(p\)-median problem
Uses Software
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)
