The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
From MaRDI portal
Publication:1630276
DOI10.1007/s10898-018-0661-yzbMath1406.90020OpenAlexW2803836921WikidataQ61940971 ScholiaQ61940971MaRDI QIDQ1630276
Torbjörn Larsson, Elina Rönnberg, YiXin Zhao, Panos M. Pardalos
Publication date: 7 December 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0661-y
regularizationcolumn generationLagrangian decompositioncore problemfixed charge transportation problem
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Consistency Cuts for Dantzig-Wolfe Reformulations, Minimum‐cost flow problems having arc‐activation costs, An integer linear programming model for efficient scheduling of UGV tasks in precision agriculture under human supervision
Uses Software
Cites Work
- Unnamed Item
- A Modeling Language for Mathematical Programming
- An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems
- An effective heuristic for large-scale capacitated facility location problems
- A new Lagrangian relaxation approach to the generalized assignment problem
- The teacher assignment problem: A special case of the fixed charge transportation problem
- A Lagrangian-based heuristic for large-scale set covering problems
- Stabilized column generation
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- A set covering reformulation of the pure fixed charge transportation problem
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
- A tabu search heuristic procedure for the fixed charge transportation problem
- Dantzig-Wolfe and Lagrangian decompositions in integer linear programming
- Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
- A technical review of column generation in integer programming
- Lagrangean relaxation. (With comments and rejoinder).
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
- Algorithms for solving the single-sink fixed-charge transportation problem
- A bicriteria solid transportation problem with fixed charge under stochastic environment
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
- COLE: a new heuristic approach for fixed charge problem computational results
- A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem
- Fixed-cost transportation problems
- Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- A method for globally minimizing concave functions over convex sets
- An Algorithm for Large Zero-One Knapsack Problems
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- The pure fixed charge transportation problem
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
- Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- A Heuristic Method for the Set Covering Problem
- Selected Topics in Column Generation
- An approximate solution method for the fixed charge problem
- The fixed charge problem
- Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
- Solving the Fixed Charge Problem by Ranking the Extreme Points
