The following pages link to Solving a network design problem (Q1876540):
Displaying 10 items.
- Double resource optimization for a robust computer network subject to a transmission budget (Q331840) (← links)
- On algorithm portfolios and restart strategies (Q631216) (← links)
- Principles for the design of large neighborhood search (Q846169) (← links)
- Sequencing surgical cases in a day-care environment: an exact branch-and-price approach (Q1010278) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- Constraint games for stable and optimal allocation of demands in SDN (Q2009195) (← links)
- Explanation-based large neighborhood search (Q2342597) (← links)
- Primal Heuristics for Branch and Price: The Assets of Diving Methods (Q5138257) (← links)
- Combining Two Structured Domains for Modeling Various Graph Matching Problems (Q5302726) (← links)
- Algorithm unions for solving discrete optimization problems (Q6066035) (← links)
