Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems
暂无分享,去创建一个
[1] Nicos Christofides,et al. A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations , 1995, Ann. Oper. Res..
[2] Nicos Christofides,et al. An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts , 1995 .
[3] Laurence A. Wolsey,et al. A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem , 2003, Networks.
[4] Panos M. Pardalos,et al. Algorithms for the single-source uncapacitated minimum concave-cost network flow problem , 1991, J. Glob. Optim..
[5] Nicos Christofides,et al. Upper bounds for single‐source uncapacitated concave minimum‐cost network flow problems , 2003, Networks.
[6] Panos M. Pardalos,et al. A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure , 1999, Oper. Res. Lett..
[7] John N. Hooker,et al. Solving Fixed-Charge Network Flow Problems with a Hybrid Optimization and Constraint Programming Approach , 2002, Ann. Oper. Res..
[8] Arie Segev,et al. Analysis of a flow problem with fixed charges , 1989, Networks.
[9] Rainer E. Burkard,et al. Linear Approximations in a Dynamic Programming Approach for the Uncapacitated Single-Source Minimum Concave Cost Network Flow Problem in Acyclic Networks , 2001, J. Glob. Optim..
[10] Reiner Horst,et al. An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks , 1994, Universität Trier, Mathematik/Informatik, Forschungsbericht.
[11] Nicos Christofides,et al. A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems , 2006, Eur. J. Oper. Res..
[12] W. Zangwill. Minimum Concave Cost Flows in Certain Networks , 1968 .
[13] Paolo Toth,et al. State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.
[14] Panos M. Pardalos,et al. Global search algorithms for minimum concave-cost network flow problems , 1991, J. Glob. Optim..
[15] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..
[16] Nicos Christofides,et al. Algorithms for large scale set covering problems , 1993, Ann. Oper. Res..
[17] Giorgio Gallo,et al. An algorithm for the min concave cost flow problem , 1980 .
[18] Bruce W. Lamar. A Method for Solving Network Flow Problems with General Nonlinear Arc Costs , 1993 .