Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
DOI10.1002/(SICI)1097-0037(200005)35:3%3C216::AID-NET5%3E3.0.CO;2-EzbMATH Open0963.90011OpenAlexW2118393703MaRDI QIDQ4488862FDOQ4488862
Authors: Dukwon Kim, Panos M. Pardalos 
Publication date: 8 July 2001
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(200005)35:3%3C216::aid-net5%3E3.0.co;2-e
Recommendations
- A bilinear relaxation based algorithm for concave piecewise linear network flow problems
- A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems
- scientific article; zbMATH DE number 1795722
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- Algorithms for network piecewise-linear programs: A comparative study
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Nonconvex programming, global optimization (90C26)
Cites Work
Cited In (21)
- A combined matheuristic for the piecewise linear multicommodity network flow problem
- COLE: a new heuristic approach for fixed charge problem computational results
- An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- 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
- Complexity analysis for maximum flow problems with arc reversals
- Local smooth representations of parametric semiclosed polyhedra with applications to sensitivity in piecewise linear programs
- Supply chain design considering economies of scale and transport frequencies
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
- A polynomial local optimality condition for the concave piecewise linear network flow problem
- A parametric simplex algorithm for biobjective piecewise linear programming problems
- A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems
- A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements
- Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
- Global and local search algorithms for concave cost transshipment problems
- Lower and upper bounds for a two-stage capacitated facility location problem with handling costs
- Bilinear modeling solution approach for fixed charge network flow problems
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
- Modeling and solving a multimodal transportation problem with flexible-time and scheduled services
This page was built for publication: Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4488862)
