Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
From MaRDI portal
Publication:4488862
DOI<216::AID-NET5>3.0.CO;2-E 10.1002/(SICI)1097-0037(200005)35:3<216::AID-NET5>3.0.CO;2-EzbMath0963.90011OpenAlexW2118393703MaRDI QIDQ4488862
Publication date: 8 July 2001
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(200005)35:3<216::aid-net5>3.0.co;2-e
Programming involving graphs or networks (90C35) Nonconvex programming, global optimization (90C26) Deterministic network models in operations research (90B10)
Related Items
A parametric simplex algorithm for biobjective piecewise linear programming problems, Bilinear modeling solution approach for fixed charge network flow problems, A polynomial local optimality condition for the concave piecewise linear network flow problem, A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements, Local smooth representations of parametric semiclosed polyhedra with applications to sensitivity in piecewise linear programs, A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem, Supply chain design considering economies of scale and transport frequencies, A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems, Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design, Adaptive dynamic cost updating procedure for solving fixed charge network flow problems, Complexity analysis for maximum flow problems with arc reversals, 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, Lower and upper bounds for a two-stage capacitated facility location problem with handling costs, Modeling and solving a multimodal transportation problem with flexible-time and scheduled services, COLE: a new heuristic approach for fixed charge problem computational results, Global and local search algorithms for concave cost transshipment problems
Cites Work
