The following pages link to (Q3439711):
Displaying 15 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)
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand (Q519091) (← 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)
- Accelerating the branch-and-price algorithm using machine learning (Q1653391) (← links)
- A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports (Q2256282) (← links)
- Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems (Q2294623) (← links)
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem (Q2336062) (← 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)
- Consistency Cuts for Dantzig-Wolfe Reformulations (Q5058051) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)