Pages that link to "Item:Q1040083"
From MaRDI portal
The following pages link to Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem (Q1040083):
Displayed 12 items.
- An efficient local search with noising strategy for Google machine reassignment problem (Q338851) (← links)
- The equilibrium generalized assignment problem and genetic algorithm (Q422905) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Clustered maximum weight clique problem: algorithms and empirical analysis (Q1652358) (← links)
- The quadratic minimum spanning tree problem and its variations (Q1662110) (← links)
- The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
- Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis (Q1728217) (← links)
- Fleet management: a vehicle and driver assignment model (Q2424765) (← links)
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs (Q2654395) (← links)
- Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations (Q2830959) (← links)
- A three-phase matheuristic algorithm for the multi-day task assignment problem (Q6047850) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)