Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems

DOI10.1007/S10479-008-0483-2zbMATH Open1181.90031OpenAlexW1972905263MaRDI QIDQ2267294FDOQ2267294

Authors: Jesús Sáez-Aguado 

Publication date: 1 March 2010

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-008-0483-2

Recommendations

• COAL: A new heuristic approach for solving the fixed charge problem - computational results
• Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach
• Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
• A tabu search heuristic procedure for the fixed charge transportation problem
• A heuristic algorithm for the fixed charge problem

zbMATH Keywords

heuristicsinteger programmingtransportation problemfixed costsLagrangean relaxationcore problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A tabu search heuristic procedure for the fixed charge transportation problem
• The fixed charge problem
• Integer-programming software systems
• Analysis of a flow problem with fixed charges
• Computational study of large-scale \(p\)-median problems
• Lagrangean relaxation. (With comments and rejoinder).
• An effective heuristic for large-scale capacitated facility location problems
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• A Heuristic Method for the Set Covering Problem
• The teacher assignment problem: A special case of the fixed charge transportation problem
• Title not available (Why is that?)
• COLE: a new heuristic approach for fixed charge problem computational results
• Fixed-cost transportation problems
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
• The fixed charge problem
• A Branch-and-Bound Method for the Fixed Charge Transportation Problem
• Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
• A set covering reformulation of the pure fixed charge transportation problem
• Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
• Algorithms for solving the single-sink fixed-charge transportation problem
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
• Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
• Solving to optimality the uncapacitated fixed-charge network flow problem
• A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
• Title not available (Why is that?)
• COAL: A new heuristic approach for solving the fixed charge problem - computational results

Cited In (17)

• Solving the facility location and fixed charge solid transportation problem
• A set covering reformulation of the pure fixed charge transportation problem
• COLE: a new heuristic approach for fixed charge problem computational results
• Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach
• Consistency cuts for Dantzig-Wolfe reformulations
• Fractional polynomial bounds for the fixed charge problem
• The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
• COAL: A new heuristic approach for solving the fixed charge problem - computational results
• A tabu search heuristic procedure for the fixed charge transportation problem
• Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
• A reduced-cost iterated local search heuristic for the fixed-charge transportation problem
• On lower bounds for the fixed charge problem
• Minimum‐cost flow problems having arc‐activation costs
• Some heuristic methods for solving \(p\)-median problems with a coverage constraint
• A sequential reduction algorithm for the large-scale fixed-charge network flow problems
• Solving fixed charge transportation problem with truck load constraint using metaheuristics
• A relaxation-strategy-based modification branch-and-bound algorithm for solving a class of transportation-production problems

This page was built for publication: Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267294)