Pages that link to "Item:Q5471083"
From MaRDI portal
The following pages link to k-Partition-based facets of the network design problem (Q5471083):
Displaying 20 items.
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- Survivable network design with shared-protection routing (Q296897) (← links)
- Near optimal design of wavelength routed optical networks (Q322603) (← links)
- Network loading problem: valid inequalities from 5- and higher partitions (Q1654355) (← links)
- Fixed charge multicommodity network design using \(p\)-partition facets (Q1698889) (← links)
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation (Q1744909) (← links)
- Generalized network design problems. (Q1810478) (← links)
- Separating tight metric inequalities by bilevel programming (Q1939716) (← links)
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality (Q2077967) (← links)
- The robust network loading problem with dynamic routing (Q2377165) (← links)
- A note on capacity models for network design (Q2417179) (← links)
- Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
- Benders Decomposition for Capacitated Network Design (Q2835663) (← links)
- Polyhedral structure of the 4-node network design problem (Q3057114) (← links)
- On cut-based inequalities for capacitated network design polyhedra (Q3082603) (← links)
- Robust Metric Inequalities for Network Loading Under Demand Uncertainty (Q3455882) (← links)
- Solving the two‐facility network design problem with 3‐partition facets (Q4642448) (← links)
- Design of Survivable Networks Using Three- and Four-Partition Facets (Q5301121) (← links)
- Robust network design: Formulations, valid inequalities, and computations (Q5326784) (← links)
- A polyhedral study of the capacity formulation of the multilayer network design problem (Q5326800) (← links)
