An approximate solution method for the fixed charge problem

From MaRDI portal
Revision as of 03:24, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5534684

DOI10.1002/NAV.3800140110zbMath0154.19601OpenAlexW1990176046MaRDI QIDQ5534684

Leon Cooper, C. Drebes

Publication date: 1967

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

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




Related Items (24)

The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generationAn approximative algorithm for the fixed charge problemOn lower bounds for the fixed charge problemComputational risk management techniques for fixed charge network flow problems with uncertain arc failuresA heuristic algorithm for the fixed charge problemA vertex ranking algorithm for the fixed-charge transportation problemDegeneracy in fixed cost transportation problemsLa programacion lineal bivalente mixta: Nuevo campo de aplicabilidad de las tecnicas de programacion linealHeuristic procedures for the m-partial cover problem on a planeA bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problemsAdaptive dynamic cost updating procedure for solving fixed charge network flow problemsQuasi-concave minimization subject to linear constraintsThe fixed charge problem. I: A new heuristic methodMinimum concave-cost network flow problems: Applications, complexity, and algorithmsExact algorithm for solving a special fixed-charge linear programming problemA study of the fixed charge transportation problemA branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber productionSolving the fixed charge problem with Lagrangian relaxation and cost allocation heuristicsFacets and algorithms for capacitated lot sizingCOLE: a new heuristic approach for fixed charge problem computational resultsA solution approach to the fixed charge network flow problem using a dynamic slope scaling procedureFixed charge problems with identical fixed chargesFractional polynomial bounds for the fixed charge problemAn algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem







This page was built for publication: An approximate solution method for the fixed charge problem