A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
暂无分享,去创建一个
[1] Warren B. Powell,et al. A numerical investigation of the impact of uncertain demand and varying risk preferences on the pricing and capacity decisions of transportation firms: The case of airlines , 1983 .
[2] A. Ali,et al. The equal flow problem , 1988 .
[3] Warrren B Powell,et al. The load planning problem of motor carriers: Problem description and a proposed solution approach , 1983 .
[4] Stavros A. Zenios,et al. On the Fine-Grain Decomposition of Multicommodity Transportation Problems , 1991, SIAM J. Optim..
[5] Robert J. Vanderbei,et al. Symmetric indefinite systems for interior point methods , 1993, Math. Program..
[6] Leonid Khachiyan,et al. Approximate minimum-cost multicommodity flows in $$\tilde O$$ (ɛ−2KNM) timetime , 1996, Math. Program..
[7] J. Kennington,et al. An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems , 1977 .
[8] Cynthia Barnhart,et al. A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems , 1993, Transp. Sci..
[9] Leonid Khachiyan,et al. An exponential-function reduction method for block-angular convex programs , 1995, Networks.
[10] Leonid Khachiyan,et al. Coordination Complexity of Parallel Price-Directive Decomposition , 1996, Math. Oper. Res..
[11] R. P. Harvey. The decomposition principle for linear programs , 1964 .
[12] Dimitri P. Bertsekas,et al. Linear network optimization - algorithms and codes , 1991 .
[13] Arjang A. Assad,et al. Multicommodity network flows - A survey , 1978, Networks.
[14] Warren B. Powell,et al. Multicommodity network flows: The impact of formulation on decomposition , 1993, Math. Program..
[15] O. SIAMJ.,et al. A SPECIALIZED INTERIOR-POINT ALGORITHM FOR MULTICOMMODITY NETWORK FLOWS∗ , 1996 .
[16] Aaas News,et al. Book Reviews , 1893, Buffalo Medical and Surgical Journal.
[17] Robert R. Meyer,et al. An Interior Point Method for Block Angular Optimization , 1991, SIAM J. Optim..
[18] Leonid Khachiyan,et al. Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints , 1994, SIAM J. Optim..
[19] Donald Goldfarb,et al. A computational comparison of the dinic and network simplex methods for maximum flow , 1988 .
[20] H. Chen,et al. A generalized chain labelling algorithm for solving multicommodity flow problems , 1974, Comput. Oper. Res..
[21] Cynthia Barnhart,et al. A column generation and partitioning approach for multi-commodity flow problems , 1994, Telecommun. Syst..
[22] Éva Tardos,et al. Improved bounds on the max-flow min-cut ratio for multicommodity flows , 1993, Comb..
[23] Jacek Gondzio,et al. Solving nonlinear multicommodity flow problems by the analytic center cutting plane method , 1997, Math. Program..
[24] Olivier du Merle,et al. A Short Note on the Comparative Behaviour of Kelley's Cutting Plane Method and the Analytic Center Cutting Plane Method , 1996 .
[25] R. Ravi,et al. Approximation through multicommodity flow , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[26] Mustafa Ç. Pinar,et al. On Smoothing Exact Penalty Functions for Convex Constrained Optimization , 1994, SIAM J. Optim..
[27] Leonid Khachiyan,et al. Approximate minimum-cost multicommodity flows in , 1996 .
[28] Warren B. Powell,et al. A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem , 1993, Oper. Res..
[29] Teodor Gabriel Crainic,et al. Bundle-based relaxation methods for multicommodity capacitated fixed charge network design , 2001, Discret. Appl. Math..
[30] Jochem Zowe,et al. A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results , 1992, SIAM J. Optim..
[31] Deep Medhi,et al. Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs , 1994, Math. Program..
[32] Clifford Stein,et al. Implementation of a Combinatorial Multicommodity Flow Algorithm , 1991, Network Flows And Matching.
[33] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..
[34] N. Karmarkar. Computational and Complexity Results for an Interior Point Algorithm on Multicommodity Flow Problems (Extended Abstract) , 1994 .
[35] M. Patriksson,et al. Conditional subgradient optimization -- Theory and applications , 1996 .
[36] James K. Ho,et al. An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming , 1981, Math. Program..
[37] Anthony J. Zahorik,et al. Network Programming Models for Production Scheduling in Multi-Stage, Multi-Item Capacitated Systems , 1984 .
[38] Éva Tardos,et al. Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..
[39] Éva Tardos,et al. Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[40] Krzysztof C. Kiwiel,et al. Proximity control in bundle methods for convex nondifferentiable minimization , 1990, Math. Program..
[41] Jeff L. Kennington,et al. A Survey of Linear Cost Multicommodity Network Flows , 1978, Oper. Res..
[42] Frank Thomson Leighton,et al. A Framework for Solving VLSI Graph Layout Problems , 1983, J. Comput. Syst. Sci..
[43] J. Hiriart-Urruty,et al. Convex analysis and minimization algorithms , 1993 .
[44] Maddalena Nonato,et al. Applying Bundle Methods to the Optimization of Polyhedral Functions: An Applications-Oriented Development , 1995 .
[45] Jeffery L. Kennington,et al. Assignment with En route training of navy personnel , 1993, Naval Research Logistics (NRL).
[46] Armand Zakarian,et al. Nonlinear Jacobi and Epsilon-relaxation methods for parallel network optimization , 1996 .
[47] George G. Polak,et al. On a parametric shortest path problem from primal - dual multicommodity network optimization , 1992, Networks.
[48] Mihalis Yannakakis,et al. Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications , 1996, SIAM J. Comput..
[49] James K. Ho,et al. Computational experience with advanced implementation of decomposition algorithms for linear programming , 1983, Math. Program..
[50] J. E. Kelley,et al. The Cutting-Plane Method for Solving Convex Programs , 1960 .
[51] C. Barnhart. Dual‐ascent methods for large‐scale multicommodity flow problems , 1993 .
[52] A. M. Geoffrion,et al. Multicommodity Distribution System Design by Benders Decomposition , 1974 .
[53] Manlio Gaudioso,et al. Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems , 1993, Ann. Oper. Res..
[54] George B. Dantzig,et al. Decomposition Principle for Linear Programs , 1960 .
[55] Antonio Frangioni,et al. Solving semidefinite quadratic problems within nonsmooth optimization algorithms , 1996, Comput. Oper. Res..
[56] Michel Minoux,et al. Networks synthesis and optimum network design problems: Models, solution methods and applications , 1989, Networks.
[57] J. Castro,et al. An implementation of linear and nonlinear multicommodity network flows , 1996 .
[58] R. Vanderbei. LOQO:an interior point code for quadratic programming , 1999 .
[59] G. Dantzig. 23. A Decomposition Principle for Linear Programs , 1963 .
[60] Fillia Makedon,et al. Fast Approximation Algorithms for Multicommodity Flow Problems , 1995, J. Comput. Syst. Sci..
[61] S. Kontogiorgis. Alternating directions methods for the parallel solution of large-scale block-structured optimization problems , 1995 .
[62] Golbon Zakeri. Multi-coordination methods for parallel solution of block-angular programs , 1996 .