Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem (Q342188): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of the Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact methods for the knapsack problem and its generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategic oscillation for the quadratic multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The case for strategic oscillation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient tabu search approach for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic tabu search for large-scale generalized assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On classes of functions for which no free lunch results hold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing assembly lines with tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for large multiple knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-neighborhood tabu search for the maximum weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memetic search for the max-bisection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The freight allocation problem with lane cost balancing constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for the multi-period inspector scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP / rank
 
Normal rank

Revision as of 22:58, 12 July 2024

scientific article
Language Label Description Also known as
English
Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
scientific article

    Statements

    Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    tabu search
    0 references
    the quadratic multiple knapsack problem
    0 references
    infeasible local search
    0 references
    0 references
    0 references

    Identifiers