Pages that link to "Item:Q694523"
From MaRDI portal
The following pages link to An exact method with variable fixing for solving the generalized assignment problem (Q694523):
Displaying 10 items.
- An implementation of exact knapsack separation (Q330511) (← links)
- Improved Lagrangian bounds and heuristics for the generalized assignment problem (Q1745880) (← links)
- Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- Convergence of the surrogate Lagrangian relaxation method (Q2260658) (← links)
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem (Q2336062) (← links)
- Primal Heuristics for Branch and Price: The Assets of Diving Methods (Q5138257) (← links)
- A three-phase matheuristic algorithm for the multi-day task assignment problem (Q6047850) (← links)
- Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity (Q6048199) (← links)
- An integer programming column generation principle for heuristic search methods (Q6066729) (← links)
