Pages that link to "Item:Q1290614"
From MaRDI portal
The following pages link to Minimum cost capacity installation for multicommodity network flows (Q1290614):
Displaying 50 items.
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- Single-commodity robust network design problem: complexity, instances and heuristic solutions (Q296864) (← links)
- Near optimal design of wavelength routed optical networks (Q322603) (← links)
- Unsplittable non-additive capacitated network design using set functions polyhedra (Q342169) (← links)
- Solving survivable two-layer network design problems by metric inequalities (Q429456) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- Routing of uncertain traffic demands (Q833385) (← links)
- A mixed-integer approach to Core-Edge design of storage area networks (Q878574) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- Source sink flows with capacity installation in batches (Q1130180) (← links)
- Minimum cost capacity installation for multicommodity network flows (Q1290614) (← links)
- Bidirected and unidirected capacity installation in telecommunication networks. (Q1417563) (← links)
- A dynamic programming algorithm for the local access telecommunication network expansion problem (Q1590815) (← links)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- Costly circuits, submodular schedules and approximate Carathéodory theorems (Q1649974) (← links)
- Network loading problem: valid inequalities from 5- and higher partitions (Q1654355) (← links)
- Fixed charge multicommodity network design using \(p\)-partition facets (Q1698889) (← links)
- Convexification of generalized network flow problem (Q1717233) (← links)
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation (Q1744909) (← links)
- Multi-commodity variable upper bound flow models (Q1751124) (← links)
- Separating tight metric inequalities by bilevel programming (Q1939716) (← links)
- Encoding binary arithmetic operations in integer programming formulations (Q2016465) (← links)
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality (Q2077967) (← links)
- Algorithms for the non-bifurcated network design problem (Q2271128) (← links)
- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut (Q2299984) (← links)
- The robust network loading problem with dynamic routing (Q2377165) (← links)
- A note on capacity models for network design (Q2417179) (← links)
- Metric inequalities and the network loading problem (Q2471279) (← links)
- Using mixed-integer programming to solve power grid blackout problems (Q2471280) (← links)
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
- Optimal solution of the discrete cost multicommodity network design problem (Q2518654) (← links)
- A partitioning algorithm for the network loading problem (Q2654332) (← links)
- New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem (Q2669599) (← links)
- Benders Decomposition for Capacitated Network Design (Q2835663) (← links)
- Exact approaches to the single-source network loading problem (Q2892148) (← links)
- Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks (Q2940074) (← links)
- Polyhedral structure of the 4-node network design problem (Q3057114) (← links)
- On cut-based inequalities for capacitated network design polyhedra (Q3082603) (← links)
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design (Q3183450) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
- Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling (Q5129179) (← links)
- New Valid Inequalities for the Optimal Communication Spanning Tree Problem (Q5138258) (← links)
- On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics (Q5214308) (← links)
- An exact approach for the multicommodity network optimization problem with a step cost function (Q5244303) (← links)
- Approximation algorithms for general one-warehouse multi-retailer systems (Q5305566) (← links)
- Robust network design: Formulations, valid inequalities, and computations (Q5326784) (← links)
- Benders decomposition approach for the robust network design problem with flow bifurcations (Q5326799) (← links)
- A polyhedral study of the capacity formulation of the multilayer network design problem (Q5326800) (← links)
