Pages that link to "Item:Q632387"

The following pages link to Benders, metric and cutset inequalities for multicommodity capacitated network design (Q632387):

Displaying 25 items.

• Benders decomposition of the passive optical network design problem (Q325394) (← links)
• Unsplittable non-additive capacitated network design using set functions polyhedra (Q342169) (← links)
• A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow (Q342561) (← links)
• Solving survivable two-layer network design problems by metric inequalities (Q429456) (← links)
• 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← 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)
• From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints (Q1662655) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← links)
• Solving the optimum communication spanning tree problem (Q1991267) (← links)
• Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301) (← links)
• Directed fixed charge multicommodity network design: a cutting plane approach using polar duality (Q2077967) (← links)
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
• A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
• New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem (Q2669599) (← links)
• The transit time constrained fixed charge multi-commodity network design problem (Q2669603) (← links)
• Benders decomposition for network design covering problems (Q2669611) (← links)
• Exact approaches to the single-source network loading problem (Q2892148) (← links)
• Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks (Q2940074) (← links)
• Stabilizing branch‐and‐price for constrained tree problems (Q5326785) (← links)
• Benders decomposition approach for the robust network design problem with flow bifurcations (Q5326799) (← links)
• Design of survivable wireless backhaul networks with reliability considerations (Q6164320) (← links)
• The complexity of the timetable‐based railway network design problem (Q6196872) (← links)