An augmented Lagrangian decomposition method for the single-source capacitated facility location problem
From MaRDI portal
No records found.
Cites work
- A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs
- A branch‐and‐price algorithm for the capacitated p‐median problem
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- A genetic algorithm for solving a capacitated \(p\)-median problem
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- A simple effective heuristic for embedded mixed-integer quadratic programming
- A survey of algorithms for the generalized assignment problem
- An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems
- An exact algorithm for the capacitated facility location problems with single sourcing
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem
- Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- Decomposition methods for global solution of mixed-integer linear programs
- Decomposition Principle for Linear Programs
- Exact augmented Lagrangian duality for mixed integer linear programming
- Exact augmented Lagrangian duality for mixed integer quadratic programming
- Facility location and supply chain management. A review
- Facility location models for distribution system design
- Integrated supply chain design models: a survey and future research directions
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Lagrangean heuristics for location problems
- Lagrangean relaxation-based techniques for solving facility location problems
- Mixed integer linear programming formulation techniques
- On the augmented Lagrangian dual for integer programming
- Partitioning procedures for solving mixed-variables programming problems
- Reformulation and decomposition of integer programs
- Scatter search for the single source capacitated facility location problem
- The Benders decomposition algorithm: a literature review
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
This page was built for publication: An augmented Lagrangian decomposition method for the single-source capacitated facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7320618)
