Pages that link to "Item:Q3082603"

The following pages link to On cut-based inequalities for capacitated network design polyhedra (Q3082603):

Displaying 30 items.

• Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
• Unsplittable non-additive capacitated network design using set functions polyhedra (Q342169) (← links)
• Proximity search for 0--1 mixed-integer convex programming (Q524882) (← links)
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
• The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
• Network loading problem: valid inequalities from 5- and higher partitions (Q1654355) (← links)
• Multi-commodity variable upper bound flow models (Q1751124) (← links)
• Steiner tree packing revisited (Q1935940) (← links)
• Separating tight metric inequalities by bilevel programming (Q1939716) (← links)
• On the approximability of robust network design (Q1998836) (← links)
• An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron (Q2052386) (← 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)
• Towards optimizing the deployment of optical access networks (Q2513732) (← links)
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
• A robust optimization model for distribution network design under a mixed integer set of scenarios (Q2669596) (← links)
• New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem (Q2669599) (← links)
• Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks (Q2940074) (← links)
• On cut-based inequalities for capacitated network design polyhedra (Q3082603) (← 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)
• Exact Approaches for Designing Multifacility Buy-at-Bulk Networks (Q5131690) (← links)
• An exact approach for the multicommodity network optimization problem with a step cost function (Q5244303) (← links)
• Robust network design: Formulations, valid inequalities, and computations (Q5326784) (← links)
• Affine recourse for the robust network design problem: Between static and dynamic routing (Q5326787) (← links)
• Benders decomposition approach for the robust network design problem with flow bifurcations (Q5326799) (← links)
• Affine routing for robust network design (Q6065910) (← links)
• Design of survivable wireless backhaul networks with reliability considerations (Q6164320) (← links)
• Valid inequalities and facets for multi‐module survivable network design problem (Q6179709) (← links)