On lower bounds for the fixed charge problem

DOI10.1016/J.COR.2014.07.009zbMATH Open1348.90055OpenAlexW2043136567MaRDI QIDQ337190FDOQ337190

Authors: Krzysztof Kowalski, Veena Adlakha 

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.07.009

Recommendations

• Fractional polynomial bounds for the fixed charge problem
• A Branch-and-Bound Method for the Fixed Charge Transportation Problem
• Use of penalties in a branch and bound procedure for the fixed charge transportation problem
• A branch-and-bound algorithm for solving fixed charge problems
• Some branch-and-bound procedures for fixed-cost transportation problems

zbMATH Keywords

transportation problembranching methodfixed chargequadratic approximation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Cites Work

• A tabu search heuristic procedure for the fixed charge transportation problem
• The fixed charge problem
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• A vertex ranking algorithm for the fixed-charge transportation problem
• The fixed charge problem. I: A new heuristic method
• Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
• 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
• An approximate solution method for the fixed charge problem
• The fixed charge problem
• Solving the Fixed Charge Problem by Ranking the Extreme Points
• A Branch-and-Bound Method for the Fixed Charge Transportation Problem
• Heuristic algorithms for the fixed-charge transportation problem

Cited In (2)

• An Iterative Solution Technique to Minimize the Average Transportation Cost of Capacitated Transportation Problem with Bounds on Rim Conditions
• A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem

This page was built for publication: On lower bounds for the fixed charge problem

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