The following pages link to (Q5294045):
Displayed 5 items.
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
- A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
- A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
- A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem (Q2883626) (← links)
- Lagrangian heuristics for the quadratic knapsack problem (Q5963311) (← links)