Pages that link to "Item:Q2471279"

The following pages link to Metric inequalities and the network loading problem (Q2471279):

Displaying 27 items.

• Survivable network design with shared-protection routing (Q296897) (← links)
• Near optimal design of wavelength routed optical networks (Q322603) (← links)
• Energy-aware survivable networks (Q325416) (← 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)
• An improved Benders decomposition applied to a multi-layer network design problem (Q1038109) (← 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)
• Separating tight metric inequalities by bilevel programming (Q1939716) (← links)
• Directed fixed charge multicommodity network design: a cutting plane approach using polar duality (Q2077967) (← 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)
• Towards optimizing the deployment of optical access networks (Q2513732) (← 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)
• Robust capacity assignment solutions for telecommunications networks with uncertain demands (Q2811313) (← links)
• Benders Decomposition for Capacitated Network Design (Q2835663) (← links)
• Exact approaches to the single-source network loading problem (Q2892148) (← 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)
• 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)
• 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)