The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
From MaRDI portal
Recommendations
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
- Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach
- A set covering reformulation of the pure fixed charge transportation problem
- Lagrangean decomposition for integer programming : theory and applications
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
Cites work
- A bicriteria solid transportation problem with fixed charge under stochastic environment
- A Heuristic Method for the Set Covering Problem
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
- A Lagrangian-based heuristic for large-scale set covering problems
- A method for globally minimizing concave functions over convex sets
- A Modeling Language for Mathematical Programming
- A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
- A new Lagrangian relaxation approach to the generalized assignment problem
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- A reduced-cost iterated local search heuristic for the fixed-charge transportation problem
- A set covering reformulation of the pure fixed charge transportation problem
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- A tabu search heuristic procedure for the fixed charge transportation problem
- A technical review of column generation in integer programming
- Algorithms for solving the single-sink fixed-charge transportation problem
- An Algorithm for Large Zero-One Knapsack Problems
- An approximate solution method for the fixed charge problem
- An effective heuristic for large-scale capacitated facility location problems
- An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems
- COLE: a new heuristic approach for fixed charge problem computational results
- Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- Dantzig-Wolfe and Lagrangian decompositions in integer linear programming
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
- Fixed-cost transportation problems
- scientific article; zbMATH DE number 1330764 (Why is no real title available?)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Lagrangean relaxation. (With comments and rejoinder).
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Selected Topics in Column Generation
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
- Stabilized column generation
- Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem
- Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- The fixed charge problem
- The pure fixed charge transportation problem
- The teacher assignment problem: A special case of the fixed charge transportation problem
Cited in
(8)- An integer linear programming model for efficient scheduling of UGV tasks in precision agriculture under human supervision
- Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach
- Consistency cuts for Dantzig-Wolfe reformulations
- Minimum‐cost flow problems having arc‐activation costs
- A sequential reduction algorithm for the large-scale fixed-charge network flow problems
- On the pure fixed charge transportation problem
- Complexity and approximation algorithms for fixed charge transportation problems
- Complexity and approximation algorithms for fixed charge transportation problems
This page was built for publication: The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1630276)
