Multicommodity Capacitated Network Design

[1]  Anantaram Balakrishnan,et al.  LP extreme points and cuts for the fixed-charge network design problem , 1987, Math. Program..

[2]  Bezalel Gavish,et al.  Topological design of telecommunication networks-local access design methods , 1991, Ann. Oper. Res..

[3]  李幼升,et al.  Ph , 1989 .

[4]  Prakash Mirchandani.  Projections of the capacitated network loading problem , 2000, Eur. J. Oper. Res..

[5]  Michel Gendreau,et al.  TOWARDS A TAXONOMY OF PARALLEL TABU SEARCH ALGORITHMS. , 1993 .

[6]  Thomas L. Magnanti,et al.  Shortest paths, single origin-destination network design, and associated polyhedra , 1993, Networks.

[7]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[8]  Luís Gouveia,et al.  A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem , 1995, Oper. Res..

[9]  Bezalel Gavish,et al.  Backbone Network Design Tools with Economic Tradeoffs , 1990, INFORMS J. Comput..

[10]  Warren B. Powell,et al.  A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem , 1993, Oper. Res..

[11]  Jonathan Eckstein,et al.  Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5 , 1994, SIAM J. Optim..

[12]  Oktay Günlük,et al.  Capacitated Network Design - Polyhedral Structure and Computation , 1996, INFORMS J. Comput..

[13]  Teodor Gabriel Crainic,et al.  PARALLEL IMPLEMENTATIONS OF BOUNDING PROCEDURES FOR MULTICOMMODITY CAPACITATED NETWORK DESIGN PROBLEMS. , 1994 .

[14]  Anantaram Balakrishnan,et al.  Valid inequalities and algorithms for the network design problem with an application to LTL consolidation , 1984 .

[15]  Teodor Gabriel Crainic,et al.  PARALLEL BRANCH-AND-BOUND ALGORITHMS: SURVEY AND SYNTHESIS , 1993 .

[16]  Marshall L. Fisher,et al.  Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..

[17]  Thomas L. Magnanti,et al.  Modeling and Solving the Two-Facility Capacitated Network Loading Problem , 1995, Oper. Res..

[18]  Peter C. Fetterolf,et al.  A Lagrangian Relaxation Technique for Optimizing Interconnection of Local Area Networks , 1992, Oper. Res..

[19]  Giorgio Gallo,et al.  A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems , 1999, INFORMS J. Comput..

[20]  M. Stoer.  Design of Survivable Networks , 1993 .

[21]  Laurence A. Wolsey,et al.  Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems , 1993 .

[22]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[23]  E. Balas,et al.  Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .

[24]  C. Lemaréchal.  Nondifferentiable optimization , 1989 .

[25]  Cynthia Barnhart,et al.  A column generation and partitioning approach for multi-commodity flow problems , 1994, Telecommun. Syst..

[26]  Oktay Günlük,et al.  Minimum cost capacity installation for multicommodity network flows , 1998, Math. Program..

[27]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[28]  Michel Minoux,et al.  Networks synthesis and optimum network design problems: Models, solution methods and applications , 1989, Networks.

[29]  T. Magnanti,et al.  Modeling and heuristic worst-case performance analysis of the two-level network design problem , 1994 .

[30]  Athanasios Migdalas,et al.  A characterization of the uncapacitated network design polytope , 1992, Oper. Res. Lett..

[31]  L. Wolsey,et al.  Chapter 9 Optimal trees , 1995 .

[32]  Cynthia Barnhart,et al.  Integer Muticommodity Flow Problems , 1996, IPCO.

[33]  Antonio Frangioni,et al.  Solving semidefinite quadratic problems within nonsmooth optimization algorithms , 1996, Comput. Oper. Res..

[34]  Ravindra K. Ahuja,et al.  Applications of network optimization , 1992 .

[35]  Thomas L. Magnanti,et al.  A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design , 1989, Oper. Res..

[36]  Francisco Barahona,et al.  Network Design Using Cut Inequalities , 1996, SIAM J. Optim..

[37]  Stephen C. Graves,et al.  A composite algorithm for a concave-cost network flow problem , 1989, Networks.

[38]  Bezalel Gavish,et al.  Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems , 1995, Oper. Res..

[39]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[40]  Leslie Hall,et al.  Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem , 1996, INFORMS J. Comput..

[41]  R. V. Helgason,et al.  Algorithms for network programming , 1980 .

[42]  Thomas L. Magnanti,et al.  Working Paper Alfred P. Sloan School of Management "models for Planning Capacity Expansion in Local Access Telecommunication Networks" "models for Planning Capacity Expansion in Local Access Telecommunication Networks" Models for Planning Capacity Expansion in Local Access Telecommunication Networks , 2008 .

[43]  Cynthia Barnhart,et al.  Multimodal express shipment service design: Models and algorithms , 1997 .

[44]  Teodor Gabriel Crainic,et al.  SIMPLEX-BASED TABU SEARCH FOR THE MULTICOMMODITY CAPACITATED FIXED CHARGE NETWORK DESIGN PROBLEM. , 1996 .

[45]  Michel Gendreau,et al.  Toward a Taxonomy of Parallel Tabu Search Heuristics , 1997, INFORMS J. Comput..

[46]  B. Gendron.  NOUVELLES METHODES DE RESOLUTION DE PROBLEMES DE CONCEPTION DE RESEAUX ET LEUR IMPLANTATION EN ENVIRONNEMENT PARALLELE , 1994 .

[47]  Bernard Gendron,et al.  Parallel Branch-and-Branch Algorithms: Survey and Synthesis , 1994, Oper. Res..

[48]  Thomas L. Magnanti,et al.  The convex hull of two core capacitated network design problems , 1993, Math. Program..

[49]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[50]  M. Stoer,et al.  A polyhedral approach to multicommodity survivable network design , 1994 .

[51]  Thomas L. Magnanti,et al.  A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning , 1995, Oper. Res..

[52]  T. Magnanti,et al.  A Dual-Based Algorithm for Multi-Level Network Design , 1994 .

[53]  Teodor Gabriel Crainic,et al.  RELAXATIONS FOR MULTICOMMODITY CAPACITATED NETWORK DESIGN PROBLEMS. , 1994 .

[54]  Ravindra K. Ahuja,et al.  Chapter 1 Applications of network optimization , 1995 .

[55]  Teodor Gabriel Crainic,et al.  BOUNDING PROCEDURES FOR MULTICOMMODITY CAPACITATED FIXED CHARGE NETWORK DESIGN PROBLEMS. , 1995 .

[56]  Maddalena Nonato,et al.  Applying Bundle Methods to the Optimization of Polyhedral Functions: An Applications-Oriented Development , 1995 .

[57]  Barry G. Silverman,et al.  Unifying Expert Systems and the Decision Sciences , 1994, Oper. Res..

[58]  Bezalel Gavish,et al.  Augmented Lagrangean Based Algorithms for Centralized Network Design , 1985, IEEE Trans. Commun..

[59]  Oktay Günlük,et al.  Computational experience with a difficult mixedinteger multicommodity flow problem , 1995, Math. Program..