Adaptive dynamic cost updating procedure for solving fixed charge network flow problems

DOI10.1007/s10589-007-9060-xzbMath1147.90310OpenAlexW2033904482MaRDI QIDQ2479831

Panos M. Pardalos, Artyom Nahapetyan

Publication date: 3 April 2008

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-007-9060-x

zbMATH Keywords

LogisticsSupply chainConcave piecewise linear network flow problemFixed charge network flow problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (8)

Solving dynamic public insurance games with endogenous agent distributions: theory and computational approximation ⋮ Bilinear modeling solution approach for fixed charge network flow problems ⋮ A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks ⋮ A heuristic method for the minimum toll booth problem ⋮ An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems ⋮ Minimum‐cost flow problems having arc‐activation costs ⋮ Computational risk management techniques for fixed charge network flow problems with uncertain arc failures ⋮ A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems

Cites Work

• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• A bilinear relaxation based algorithm for concave piecewise linear network flow problems
• Supply chain optimization.
• Some branch-and-bound procedures for fixed-cost transportation problems
• An approximative algorithm for the fixed-charges transportation problem
• A New Optimization Method for Large Scale Fixed Charge Transportation Problems
• Approximate solutions of capacitated fixed-charge minimum cost network flow problems
• Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problems
• A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
• Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
• An approximate solution method for the fixed charge problem
• The fixed charge problem
• Technical Note—Exact Solution of the Fixed-Charge Transportation 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: Adaptive dynamic cost updating procedure for solving fixed charge network flow problems