Pages that link to "Item:Q5690264"

The following pages link to Capacitated Network Design—Polyhedral Structure and Computation (Q5690264):

Displaying 50 items.

• Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
• Unsplittable non-additive capacitated network design using set functions polyhedra (Q342169) (← links)
• Cutting planes in integer and mixed integer programming (Q697578) (← links)
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← 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)
• A local branching heuristic for the capacitated fixed-charge network design problem (Q1038297) (← links)
• Capacitated facility location: Separation algorithms and computational experience (Q1290613) (← links)
• Minimum cost capacity installation for multicommodity network flows (Q1290614) (← links)
• Bidirected and unidirected capacity installation in telecommunication networks. (Q1417563) (← links)
• Benders-and-cut algorithm for fixed-charge capacitated network design problem (Q1582048) (← links)
• New modeling approaches for the design of local access transport area networks (Q1590803) (← links)
• A dynamic programming algorithm for the local access telecommunication network expansion problem (Q1590815) (← links)
• The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
• Network loading problem: valid inequalities from 5- and higher partitions (Q1654355) (← links)
• On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization (Q1686496) (← links)
• Diversification strategies in local search for a nonbifurcated network loading problem (Q1848356) (← links)
• Multi-period traffic routing in satellite networks (Q1926695) (← links)
• Valid inequalities and separation for capacitated fixed charge flow problems (Q1962074) (← links)
• An effective logarithmic formulation for piecewise linearization requiring no inequality constraint (Q2044490) (← 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)
• Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut (Q2299984) (← links)
• Lifting for mixed integer programs with variable upper bounds (Q2345614) (← links)
• A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design (Q2357911) (← links)
• The multi-layered network design problem (Q2370332) (← links)
• A note on capacity models for network design (Q2417179) (← links)
• Metric inequalities and the network loading problem (Q2471279) (← links)
• Description of 2-integer continuous knapsack polyhedra (Q2506817) (← links)
• Towards optimizing the deployment of optical access networks (Q2513732) (← links)
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
• Sequence independent lifting for mixed integer programs with variable upper bounds (Q2583140) (← links)
• Perspective reformulations of mixed integer nonlinear programs with indicator variables (Q2638370) (← 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)
• On the robustness of potential-based flow networks (Q2689822) (← 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)
• Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
• A directed cycle-based column-and-cut generation method for capacitated survivable network design (Q4474304) (← links)
• MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem (Q5149549) (← 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)
• Affine recourse for the robust network design problem: Between static and dynamic routing (Q5326787) (← 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)
• Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité (Q5479860) (← links)
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design (Q5946817) (← links)
• Valid inequalities and facets for multi‐module survivable network design problem (Q6179709) (← links)