An efficient tabu search approach for the 0-1 multidimensional knapsack problem (Q1609923): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot and Complement–A Heuristic for 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Reactive Tabu Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search with memory: Benchmarking RTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The noising method: A new method for combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic tabu list management using the reverse elimination method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing approach to the multiconstraint zero-one knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New optimization heuristics. The great deluge algorithm and the record- to-record travel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating surrogate constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the 0-1 collapsing knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics and reduction methods for multiple constraints 0-1 linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory and Computation of Knapsack Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Thresholding: Improved Search by Nonmonotonic Trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Neural'' computation of decisions in optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search within a pivot and complement framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350070 / rank
 
Normal rank

Latest revision as of 14:59, 4 June 2024

scientific article
Language Label Description Also known as
English
An efficient tabu search approach for the 0-1 multidimensional knapsack problem
scientific article

    Statements

    An efficient tabu search approach for the 0-1 multidimensional knapsack problem (English)
    0 references
    0 references
    0 references
    18 August 2002
    0 references
    0 references
    tabu search
    0 references
    0-1 multidimensional knapsack
    0 references
    strategic oscillation
    0 references
    surrogate duality
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references