The following pages link to (Q3439711):
Displayed 9 items.
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks (Q323507) (← links)
- An implementation of exact knapsack separation (Q330511) (← links)
- An exact method with variable fixing for solving the generalized assignment problem (Q694523) (← links)
- Chebyshev center based column generation (Q765323) (← links)
- A computational study of exact knapsack separation for the generalized assignment problem (Q967219) (← links)
- A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports (Q2256282) (← links)
- A cutting plane method for knapsack polytope (Q2391714) (← links)
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657) (← links)
- New approaches to nurse rostering benchmark instances (Q2514811) (← links)