The following pages link to (Q5294045):
Displaying 11 items.
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- Efficient cuts in Lagrangean `relax-and-cut' schemes (Q1291724) (← links)
- 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)
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies (Q1919186) (← links)
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes (Q1972019) (← 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)
- A Lagrangian Relaxation for Golomb Rulers (Q4922916) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900323) (← links)
- Lagrangian heuristics for the quadratic knapsack problem (Q5963311) (← links)
