scientific article; zbMATH DE number 1054947
From MaRDI portal
Publication:4350063
zbMATH Open0877.90055MaRDI QIDQ4350063FDOQ4350063
Authors: Fred Glover, Gary A. Kochenberger 
Publication date: 11 December 1997
Title of this publication is not available (Why is that?)
Recommendations
- Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
- scientific article; zbMATH DE number 1488074
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
- Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
- First-level tabu search approach for solving the multiple-choice multidimensional knapsack problem
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- An approximate dynamic programming approach to multidimensional knapsack problems
Cited In (45)
- Adaptive memory search for multidemand multidimensional knapsack problems
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
- A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
- Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems
- Simple and fast surrogate constraint heuristics for the maximum independent set problem
- An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem
- A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles
- Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
- Constructing efficient simulated annealing algorithms
- Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- Tabu search: global intensification using dynamic programming
- A combined parallel algorithm for solving the knapsack problem
- Scatter search for the 0-1 multidimensional knapsack problem
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Nurse scheduling with tabu search and strategic oscillation
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- Heuristic methods for evolutionary computation techniques
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- CORAL: an exact algorithm for the multidimensional knapsack problem
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- A self-guided genetic algorithm for permutation flowshop scheduling problems
- Improved results on the 0--1 multidimensional knapsack problem
- Extension of reverse elimination method through a dynamic management of the tabu list
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- Adaptive memory search for Boolean optimization problems
- An ant colony optimization approach for the multidimensional knapsack problem
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- New convergent heuristics for 0-1 mixed integer programming
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
- Metaheuristics: A bibliography
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4350063)
