Pages that link to "Item:Q342188"
From MaRDI portal
The following pages link to Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem (Q342188):
Displaying 12 items.
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (Q2030649) (← links)
- A matheuristic for the 0--1 generalized quadratic multiple knapsack problem (Q2070116) (← links)
- A branch-and-bound algorithm for the quadratic multiple knapsack problem (Q2076914) (← links)
- Learning-based multi-objective evolutionary algorithm for batching decision problem (Q2108120) (← links)
- Learning-driven feasible and infeasible tabu search for airport gate assignment (Q2140326) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- A hybrid evolutionary search for the generalized quadratic multiple knapsack problem (Q2242328) (← links)
- Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
- Lagrangian matheuristics for the quadratic multiple knapsack problem (Q6041829) (← links)
- A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment (Q6090150) (← links)
