An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
From MaRDI portal
Publication:1327230
DOI10.1016/0166-218X(94)90209-7zbMath0802.90077MaRDI QIDQ1327230
Gérard Plateau, Arnaud Fréville
Publication date: 15 June 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
Dynamic tabu list management using the reverse elimination method, A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances, New convergent heuristics for 0-1 mixed integer programming, Heuristics for the multi-resource generalized assignment problem, A RNN-based hyper-heuristic for combinatorial problems, Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem, Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem, A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems, The multidimensional 0-1 knapsack problem: an overview., Scatter search for the 0-1 multidimensional knapsack problem, A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem, Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When?, Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem, A multi-level search strategy for the 0-1 multidimensional knapsack problem, Improved convergent heuristics for the 0-1 multidimensional knapsack problem, Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints, An ant colony optimization approach for the multidimensional knapsack problem, Improved results on the 0--1 multidimensional knapsack problem, A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem, A comparative analysis of two matheuristics by means of merged local optima networks, An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core, Heuristics for the 0-1 multidimensional knapsack problem, A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems, An efficient tabu search approach for the 0-1 multidimensional knapsack problem, 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
- Unnamed Item
- Unnamed Item
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- Surrogate duality in a branch-and-bound procedure for integer programming
- Dynamic programming algorithms for the zero-one knapsack problem
- Heuristic algorithms for the multiple knapsack problem
- An algorithm for the solution of the 0-1 knapsack problem
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- Zero-one programming with many variables and few constraints
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
- Heuristic methods and applications: A categorized survey
- An aggregate subgradient method for nonsmooth convex minimization
- On the Solution of Discrete Programming Problems
- A descent algorithm for nonsmooth convex optimization
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Solving Large-Scale Zero-One Linear Programming Problems
- A Note on Approximation Schemes for Multidimensional Knapsack Problems
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- A New Algorithm for the 0-1 Knapsack Problem
- Fast Approximation Algorithms for Knapsack Problems
- Pivot and Complement–A Heuristic for 0-1 Programming
- Hard Knapsack Problems
- An Algorithm for Large Zero-One Knapsack Problems
- Calculating surrogate constraints
- Coefficient reduction for inequalities in 0–1 variables
- Constraint Pairing In Integer Programming
- Reduction Algorithm for Zero-One Single Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- Validation of subgradient optimization
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- The Theory and Computation of Knapsack Functions
- An Improved Implicit Enumeration Approach for Integer Programming
- Surrogate Mathematical Programming
