Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem (Q2255966): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2013.07.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000151189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated greedy local search methods for unrelated parallel machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Memory Tabu Search for Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations of the critical region of the fbietkan statistic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note: A local-search heuristic for large set-covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale pickup and delivery work area design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained compartmentalized knapsack problem: mathematical models and solution methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated greedy for the maximum diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shifting representation search for hybrid flexible flowline problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects for multiple-choice hardware/software partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem / rank
 
Normal rank

Latest revision as of 16:41, 9 July 2024

scientific article
Language Label Description Also known as
English
Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
scientific article

    Statements

    Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem (English)
    0 references
    18 February 2015
    0 references
    iterated greedy search
    0 references
    tabu search
    0 references
    quadratic multiple knapsack problem
    0 references
    destruction mechanism
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers