An approximate solution method for the fixed charge problem
From MaRDI portal
Publication:5534684
DOI10.1002/nav.3800140110zbMath0154.19601OpenAlexW1990176046MaRDI QIDQ5534684
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
The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation, An approximative algorithm for the fixed charge problem, On lower bounds for the fixed charge problem, Computational risk management techniques for fixed charge network flow problems with uncertain arc failures, A heuristic algorithm for the fixed charge problem, A vertex ranking algorithm for the fixed-charge transportation problem, Degeneracy in fixed cost transportation problems, La programacion lineal bivalente mixta: Nuevo campo de aplicabilidad de las tecnicas de programacion lineal, Heuristic procedures for the m-partial cover problem on a plane, A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems, Adaptive dynamic cost updating procedure for solving fixed charge network flow problems, Quasi-concave minimization subject to linear constraints, The fixed charge problem. I: A new heuristic method, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, Exact algorithm for solving a special fixed-charge linear programming problem, A study of the fixed charge transportation problem, A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production, Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics, Facets and algorithms for capacitated lot sizing, COLE: a new heuristic approach for fixed charge problem computational results, A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure, Fixed charge problems with identical fixed charges, Fractional polynomial 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
