The following pages link to Laurence A. Wolsey (Q173889):
Displaying 12 items.
- Relaxation Methods for Pure and Mixed Integer Programming Problems (Q5635257) (← links)
- Group-Theoretic Results in Mixed Integer Programming (Q5640998) (← links)
- Extensions of the Group Theoretic Approach in Integer Programming (Q5650209) (← links)
- Generalized dynamic programming methods in integer programming (Q5685859) (← links)
- Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs (Q5704092) (← links)
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5907039) (← links)
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5920488) (← links)
- The uncapacitated lot-sizing problem with sales and safety stocks (Q5930740) (← links)
- Scheduling projects with labor constraints (Q5946815) (← links)
- The continuous knapsack set (Q5962725) (← links)
- A study of lattice reformulations for integer programming (Q6047692) (← links)
- Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing (Q6113311) (← links)