Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
From MaRDI portal
Publication:4546065
DOI10.1051/ro:2001123zbMath1015.90056OpenAlexW2062924625MaRDI QIDQ4546065
Publication date: 18 August 2002
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2001__35_4_415_0
Related Items (21)
Problems of discrete optimization: challenges and main approaches to solve them ⋮ New convergent heuristics for 0-1 mixed integer programming ⋮ A Modified Binary Particle Swarm Optimization for Knapsack Problems ⋮ Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization ⋮ Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem ⋮ Intelligent water drops algorithm ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ Scatter search for the 0-1 multidimensional knapsack problem ⋮ Bringing order into the neighborhoods: Relaxation guided variable neighborhood search ⋮ Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem ⋮ A multi-level search strategy for the 0-1 multidimensional knapsack problem ⋮ Improved convergent heuristics for the 0-1 multidimensional knapsack problem ⋮ Alternating control tree search for knapsack/covering problems ⋮ An ant colony optimization approach for the multidimensional knapsack problem ⋮ Improved results on the 0--1 multidimensional knapsack problem ⋮ A trust branching path heuristic for zero-one programming ⋮ CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem ⋮ An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem ⋮ Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- The noising method: A new method for combinatorial optimization
- The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- Solving zero-one mixed integer programming problems using tabu search
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Dynamic tabu list management using the reverse elimination method
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach
- Pivot and Complement–A Heuristic for 0-1 Programming
- Tabu Search—Part II
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
- Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
- The Reactive Tabu Search
- The Theory and Computation of Knapsack Functions
This page was built for publication: Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
