On lower bounds for the fixed charge problem

DOI10.1016/j.cor.2014.07.009zbMath1348.90055OpenAlexW2043136567MaRDI QIDQ337190

Krzysztof Kowalski, Veena G. 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

zbMATH Keywords

transportation problemquadratic approximationfixed chargebranching method

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Heuristic algorithms for the fixed-charge transportation problem
• A vertex ranking algorithm for the fixed-charge transportation problem
• The fixed charge problem. I: A new heuristic method
• A tabu search heuristic procedure for the fixed charge transportation problem
• 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
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• An approximate solution method for the fixed charge problem
• 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

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