The following pages link to (Q5629416):
Displaying 37 items.
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625) (← links)
- Benders decomposition of the passive optical network design problem (Q325394) (← links)
- Solving survivable two-layer network design problems by metric inequalities (Q429456) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Routing of uncertain traffic demands (Q833385) (← links)
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles (Q951116) (← links)
- Tight spans of distances and the dual fractionality of undirected multiflow problems (Q1044206) (← links)
- Combinatorial approaches to multiflow problems (Q1080357) (← links)
- Computing extreme rays of the metric cone for seven points (Q1193551) (← links)
- A \(T_X\)-approach to some results on cuts and metrics (Q1384029) (← links)
- Projections of the capacitated network loading problem (Q1577107) (← links)
- Network loading problem: valid inequalities from 5- and higher partitions (Q1654355) (← links)
- Fixed charge multicommodity network design using \(p\)-partition facets (Q1698889) (← links)
- Metric inequalities for routings on direct connections with application to line planning (Q1751129) (← links)
- A heuristic for the continuous capacity and flow assignment (Q1869661) (← links)
- Applications of cut polyhedra. II (Q1891020) (← links)
- One-third-integrality in the max-cut problem (Q1924057) (← links)
- Separating tight metric inequalities by bilevel programming (Q1939716) (← links)
- A generalized cut-condition for multiflows in matroids (Q2366020) (← links)
- The multi-layered network design problem (Q2370332) (← links)
- The robust network loading problem with dynamic routing (Q2377165) (← links)
- New discoveries of domination between traffic matrices (Q2401765) (← links)
- Metric inequalities and the network loading problem (Q2471279) (← links)
- A constraint generation algorithm for large scale linear programs using multiple-points separation (Q2492707) (← links)
- Benders Decomposition for Capacitated Network Design (Q2835663) (← links)
- LP-Based Algorithms for Capacitated Facility Location (Q2968155) (← links)
- On the minimum cost multiple-source unsplittable flow problem (Q3004201) (← links)
- Polyhedral structure of the 4-node network design problem (Q3057114) (← links)
- On cut-based inequalities for capacitated network design polyhedra (Q3082603) (← links)
- Projecting the flow variables for hub location problems (Q3156823) (← links)
- Metrics and undirected cuts (Q3680585) (← links)
- Engpässe, Staustellen und glatte homogene Ströme in Netzen (Q4168794) (← links)
- Improved approximations for the minimum-cut ratio and the flux (Q4866679) (← links)
- Affine recourse for the robust network design problem: Between static and dynamic routing (Q5326787) (← links)
- A polyhedral study of the capacity formulation of the multilayer network design problem (Q5326800) (← links)
- The projected pairwise multicommodity flow polyhedron (Q5938940) (← links)
- On describing the routing capacity regions of networks (Q5962149) (← links)
