scientific article; zbMATH DE number 1054947
From MaRDI portal
Publication:4350063
zbMath0877.90055MaRDI QIDQ4350063
Fred Glover, Gary A. Kochenberger
Publication date: 11 December 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem, Adaptive memory search for Boolean optimization problems, New convergent heuristics for 0-1 mixed integer programming, Une approche hybride pour le sac à dos multidimensionnel en variables 0–1, Constructing efficient simulated annealing algorithms, Metaheuristics: A bibliography, Heuristic methods for evolutionary computation techniques, A Modified Binary Particle Swarm Optimization for Knapsack Problems, Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems, Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems, Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method, A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem, A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, The multidimensional 0-1 knapsack problem: an overview., Scatter search for the 0-1 multidimensional knapsack problem, A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles, A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem, Bringing order into the neighborhoods: Relaxation guided variable neighborhood search, Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem, Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method, A self-guided genetic algorithm for permutation flowshop scheduling problems, Improved convergent heuristics for the 0-1 multidimensional knapsack problem, Adaptive memory search for multidemand multidimensional knapsack problems, Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List, Kernel search: a general heuristic for the multi-dimensional knapsack problem, Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, An ant colony optimization approach for the multidimensional knapsack problem, \(\text{MA}\mid\text{PM}\): memetic algorithms with population management, Improved results on the 0--1 multidimensional knapsack problem, Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints, Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems, A combined parallel algorithm for solving the knapsack problem, Simple and fast surrogate constraint heuristics for the maximum independent set problem, A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs, CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem, An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem, Nurse scheduling with tabu search and strategic oscillation, An efficient tabu search approach for the 0-1 multidimensional knapsack problem, Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Uses Software
