A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems
From MaRDI portal
Publication:5928210
DOI10.1023/A:1026502220076zbMath0988.90002OpenAlexW1591038343MaRDI QIDQ5928210
Publication date: 22 July 2002
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1026502220076
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (10)
A branch-cut-and-price algorithm for the piecewise linear transportation problem ⋮ A note on maxmin problem ⋮ On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems ⋮ A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem ⋮ Supply chain design considering economies of scale and transport frequencies ⋮ Maximum flow problem in wireless ad hoc networks with directional antennas ⋮ Attractive force search algorithm for piecewise convex maximization problems ⋮ A branch-and-bound algorithm for concave network flow problems ⋮ A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems ⋮ Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
This page was built for publication: A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems
