Pages that link to "Item:Q1806022"

The following pages link to A branch-and-cut algorithm for capacitated network design problems (Q1806022):

Displaying 44 items.

• Solving survivable two-layer network design problems by metric inequalities (Q429456) (← 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)
• Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles (Q951116) (← links)
• Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks (Q953207) (← 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)
• Benders-and-cut algorithm for fixed-charge capacitated network design problem (Q1582048) (← links)
• The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
• Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559) (← links)
• Network loading problem: valid inequalities from 5- and higher partitions (Q1654355) (← links)
• Generalized local branching heuristics and the capacitated ring tree problem (Q1744240) (← links)
• Multi-commodity variable upper bound flow models (Q1751124) (← links)
• Diversification strategies in local search for a nonbifurcated network loading problem (Q1848356) (← links)
• On capacitated network design cut-set polyhedra (Q1849499) (← links)
• Multi-period traffic routing in satellite networks (Q1926695) (← links)
• Models and algorithms for network design problems (Q1936663) (← links)
• Separating tight metric inequalities by bilevel programming (Q1939716) (← links)
• An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes (Q1994496) (← links)
• An effective logarithmic formulation for piecewise linearization requiring no inequality constraint (Q2044490) (← links)
• A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design (Q2357911) (← links)
• A note on capacity models for network design (Q2417179) (← links)
• The Steiner connectivity problem (Q2434988) (← links)
• Metric inequalities and the network loading problem (Q2471279) (← links)
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
• A robust optimization model for distribution network design under a mixed integer set of scenarios (Q2669596) (← 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)
• Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
• Robust Metric Inequalities for Network Loading Under Demand Uncertainty (Q3455882) (← links)
• (Q3840278) (← links)
• (Q3840281) (← links)
• (Q4031976) (← links)
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem (Q4808430) (← links)
• Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling (Q5129179) (← 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)
• 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)
• Algorithms – ESA 2005 (Q5475818) (← links)
• Capacitated Network Design—Polyhedral Structure and Computation (Q5690264) (← links)
• A branch-and-cut approach for minimum cost multi-level network design (Q5957748) (← links)