Pages that link to "Item:Q689128"
From MaRDI portal
The following pages link to The convex hull of two core capacitated network design problems (Q689128):
Displaying 45 items.
- Continuous knapsack sets with divisible capacities (Q263180) (← links)
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- Survivable network design with shared-protection routing (Q296897) (← links)
- Unsplittable non-additive capacitated network design using set functions polyhedra (Q342169) (← links)
- A stabilized structured Dantzig-Wolfe decomposition method (Q359629) (← links)
- Generalized coefficient strengthening cuts for mixed integer programming (Q683740) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- A capacity scaling heuristic for the multicommodity capacitated network design problem (Q837097) (← links)
- Design of survivable IP-over-optical networks (Q863570) (← links)
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles (Q951116) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- Bidirected and unidirected capacity installation in telecommunication networks. (Q1417563) (← links)
- Projections of the capacitated network loading problem (Q1577107) (← links)
- Service network design in freight transportation (Q1582187) (← links)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- Robust gateway placement in wireless mesh networks (Q1652709) (← 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)
- Valid inequalities for the single arc design problem with set-ups (Q1751105) (← links)
- Branch-and-price-and-cut for a service network design and hub location problem (Q1752143) (← links)
- Diversification strategies in local search for a nonbifurcated network loading problem (Q1848356) (← 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)
- Algorithms for the non-bifurcated network design problem (Q2271128) (← links)
- A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations (Q2275582) (← links)
- Lifting for mixed integer programs with variable upper bounds (Q2345614) (← links)
- The robust network loading problem with dynamic routing (Q2377165) (← links)
- Revisiting Lagrangian relaxation for network design (Q2414466) (← links)
- A note on capacity models for network design (Q2417179) (← links)
- A polyhedral study of the semi-continuous knapsack problem (Q2434996) (← links)
- The splittable flow arc set with capacity and minimum load constraints (Q2450712) (← links)
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
- Discretized formulations for capacitated location problems with modular distribution costs (Q2655611) (← links)
- Benders Decomposition for Capacitated Network Design (Q2835663) (← 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)
- The Two Level Network Design Problem with Secondary Hop Constraints (Q3091484) (← links)
- Robust Metric Inequalities for Network Loading Under Demand Uncertainty (Q3455882) (← links)
- A directed cycle-based column-and-cut generation method for capacitated survivable network design (Q4474304) (← links)
- Optimization in telecommunication networks (Q5313481) (← links)
- A polyhedral study of the capacity formulation of the multilayer network design problem (Q5326800) (← links)
- The continuous knapsack set (Q5962725) (← links)
