Pages that link to "Item:Q1338830"

The following pages link to A polyhedral approach to multicommodity survivable network design (Q1338830):

Displaying 32 items.

• Solving survivable two-layer network design problems by metric inequalities (Q429456) (← links)
• Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
• Benders, metric and cutset inequalities for multicommodity capacitated network design (Q632387) (← links)
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
• Design of survivable IP-over-optical networks (Q863570) (← links)
• Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
• Minimum cost capacity installation for multicommodity network flows (Q1290614) (← links)
• Economic spare capacity planning for DCS mesh-restorable networks (Q1303707) (← links)
• Exact solution of multicommodity network optimization problems with general step cost functions (Q1306346) (← links)
• A primal partitioning approach for single and non-simultaneous multicommodity flow problems (Q1569942) (← links)
• A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759) (← links)
• On survivable network polyhedra (Q1772416) (← links)
• Network synthesis under survivability constraints (Q1878995) (← links)
• The multi-layered network design problem (Q2370332) (← links)
• Multicommodity network design with survivability constraints: some models and algorithms. (Abstract of thesis) (Q2386688) (← 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)
• Towards optimizing the deployment of optical access networks (Q2513732) (← links)
• Optimal solution of the discrete cost multicommodity network design problem (Q2518654) (← links)
• A GRASP algorithm for a capacitated, fixed charge, multicommodity network flow problem with uncertain demand and survivability constraints (Q3002558) (← links)
• Polyhedral structure of the 4-node network design problem (Q3057114) (← links)
• Survivable capacitated network design problem: new formulation and Lagrangean relaxation (Q3156578) (← links)
• (Q3181418) (← links)
• A directed cycle-based column-and-cut generation method for capacitated survivable network design (Q4474304) (← links)
• An exact approach for the multicommodity network optimization problem with a step cost function (Q5244303) (← links)
• Approximation algorithms for general one-warehouse multi-retailer systems (Q5305566) (← links)
• A polyhedral study of the capacity formulation of the multilayer network design problem (Q5326800) (← links)
• Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité (Q5479860) (← links)
• Strong inequalities for capacitated survivable network design problems. (Q5926334) (← 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)
• Robust capacitated Steiner trees and networks with uniform demands (Q6179720) (← links)