Minimum cost capacity installation for multicommodity network flows

DOI10.1007/BF01581104zbMATH Open0922.90064OpenAlexW2051290577MaRDI QIDQ1290614FDOQ1290614

Authors: Sunil Chopra, Oktay Günlük, Chih-Yang Tsai, Daniel Bienstock 

Publication date: 18 October 1999

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01581104

Recommendations

• A polyhedral approach to multicommodity survivable network design
• Capacitated Network Design—Polyhedral Structure and Computation
• A polyhedral approach to an integer multicommodity flow problem
• Optimal solution of the discrete cost multicommodity network design problem
• Metric inequalities and the network loading problem

zbMATH Keywords

directed graphnetwork designmetric inequalitiesaggregated multicommodity flow formulationminimum cost installation of capacity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Integer programming (90C10)

Cites Work

• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Title not available (Why is that?)
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• Minimum cost capacity installation for multicommodity network flows
• Network Design Using Cut Inequalities
• Capacitated Network Design—Polyhedral Structure and Computation
• A polyhedral approach to multicommodity survivable network design
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
• Computational experience with a difficult mixed-integer multicommodity flow problem

Cited In (53)

• Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
• Network models with unsplittable node flows with application to unit train scheduling
• The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
• New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem
• Benders decomposition approach for the robust network design problem with flow bifurcations
• A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
• Chance-constrained optimization of reliable fixed broadband wireless networks
• New valid inequalities for the optimal communication spanning tree problem
• A dynamic programming algorithm for the local access telecommunication network expansion problem
• Source sink flows with capacity installation in batches
• Multi-commodity variable upper bound flow models
• Algorithms and extended formulations for one and two facility network design
• Single-commodity robust network design with finite and hose demand sets
• Single-commodity robust network design problem: complexity, instances and heuristic solutions
• A note on capacity models for network design
• Bidirected and unidirected capacity installation in telecommunication networks.
• Solving survivable two-layer network design problems by metric inequalities
• Routing of uncertain traffic demands
• Costly circuits, submodular schedules and approximate Carathéodory theorems
• A mixed-integer approach to Core-Edge design of storage area networks
• Convexification of generalized network flow problem
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
• Network loading problem: valid inequalities from 5- and higher partitions
• Graphs and algorithms in communication networks on seven league boots
• Near optimal design of wavelength routed optical networks
• Minimum cost capacity installation for multicommodity network flows
• Optimal solution of the discrete cost multicommodity network design problem
• On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics
• Robust network design: formulations, valid inequalities, and computations
• Unsplittable non-additive capacitated network design using set functions polyhedra
• A polyhedral study of the capacity formulation of the multilayer network design problem
• Algorithms for the non-bifurcated network design problem
• A partitioning algorithm for the network loading problem
• 0-1 reformulations of the multicommodity capacitated network design problem
• Cutting planes in integer and mixed integer programming
• An exact approach for the multicommodity network optimization problem with a step cost function
• The robust network loading problem with dynamic routing
• Fixed charge multicommodity network design using \(p\)-partition facets
• Metric inequalities and the network loading problem
• Using mixed-integer programming to solve power grid blackout problems
• Approximation Algorithms for Buy-at-Bulk Geometric Network Design
• Benders decomposition for capacitated network design
• Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
• Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
• Separating tight metric inequalities by bilevel programming
• Encoding binary arithmetic operations in integer programming formulations
• On cut-based inequalities for capacitated network design polyhedra
• Polyhedral structure of the 4-node network design problem
• Exact approaches to the single-source network loading problem
• Approximation algorithms for general one-warehouse multi-retailer systems
• Multicommodity network flows: a survey. I: Applications and formulations
• Multicommodity network flows: A survey. II: Solution methods

This page was built for publication: Minimum cost capacity installation for multicommodity network flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290614)