A Dynamic Domain Contraction Algorithm for Nonconvex Piecewise Linear Network Flow Problems*
Authors:
- 1 September 2000
- journal article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 17 (1-4) , 225-234
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problemsNetworks, 2000
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedureOperations Research Letters, 1999
- Handbook of Global Optimization1995
- Solving the staircase cost facility location problem with decomposition and piecewise linearizationEuropean Journal of Operational Research, 1994
- A Method for Solving Network Flow Problems with General Nonlinear Arc Costs1993
- Global search algorithms for minimum concave-cost network flow problemsJournal of Global Optimization, 1991
- Minimum concave-cost network flow problems: Applications, complexity, and algorithmsAnnals of Operations Research, 1990
- Integer and Combinatorial Optimization1988
- Enumerative techniques for solving some nonconvex global optimization problemsOR Spectrum, 1988
- Minimizing a sum of staircase functions under linear constraintsOptimization, 1988