A cutting plane algorithm for the capacitated facility location problem
From MaRDI portal
Recommendations
- Capacitated facility location: Separation algorithms and computational experience
- Weak flow cover inequalities for the capacitated facility location problem
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- Capacitated Facility Location: Valid Inequalities and Facets
- A cutting plane algorithm for the capacitated connected facility location problem
Cites work
- A branch-and-price algorithm for the capacitated facility location problem
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- A comparison of heuristics and relaxations for the capacitated plant location problem
- An effective heuristic for large-scale capacitated facility location problems
- Capacitated facility location: Separation algorithms and computational experience
- Capacitated Facility Location: Valid Inequalities and Facets
- Computational study of large-scale p-median problems
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1303535 (Why is no real title available?)
- scientific article; zbMATH DE number 1342123 (Why is no real title available?)
- Lagrangean heuristics for location problems
- The 0-1 knapsack problem with a single continuous variable
- The quickhull algorithm for convex hulls
- The volume algorithm: Producing primal solutions with a subgradient method
- Valid inequalities and facets of the capacitated plant location problem
Cited in
(21)- Capacitated facility location: Separation algorithms and computational experience
- A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- Weak flow cover inequalities for the capacitated facility location problem
- On single-source capacitated facility location with cost and fairness objectives
- A new extended formulation with valid inequalities for the capacitated concentrator location problem
- A fast exact method for the capacitated facility location problem with differentiable convex production costs
- Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models
- RAMP algorithms for the capacitated facility location problem
- A dual RAMP algorithm for single source capacitated facility location problems
- A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
- A heuristic for BILP problems: the single source capacitated facility location problem
- An algorithm for a class of uncapacitated facility location problem based on branch-and-cut method
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Solving capacitated facility location problems by Fenchel cutting planes
- A cutting plane algorithm for the general routing problem
- Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
- Enhanced capacitated facility location problem for mental accounting management using partial resource concentration
- Cover-based inequalities for the single-source capacitated facility location problem with customer preferences
This page was built for publication: A cutting plane algorithm for the capacitated facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q842775)
