The fixed charge problem

DOI10.1002/NAV.3800170209zbMATH Open0203.52301OpenAlexW1976906815MaRDI QIDQ5603733FDOQ5603733

Authors: David Steinberg 

Publication date: 1970

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800170209

Cites Work

• An approximative algorithm for the fixed charge problem

Cited In (24)

• Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
• Heuristische Lösungsverfahren Versuch einer Begriffsklärung
• COLE: a new heuristic approach for fixed charge problem computational results
• Degeneracy in fixed cost transportation problems
• An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems
• Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
• Fractional polynomial bounds for the fixed charge problem
• 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
• Exact algorithm for solving a special fixed-charge linear programming problem
• On lower bounds for the fixed charge problem
• An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem
• A heuristic algorithm for the fixed charge problem
• Fixed charge problems with identical fixed charges
• A vertex ranking algorithm for the fixed-charge transportation problem
• An algorithm for solving fixed-charge problems using surrogate constraints
• The fixed charge problem. I: A new heuristic method
• An algorithm for solving fixed charge bi-criterion transportation problem with restricted flow
• Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
• Facets and algorithms for capacitated lot sizing
• A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
• The pure fixed charge transportation problem

This page was built for publication: The fixed charge problem

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