An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
type: Item
instance of: scholarly article
title: An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
zbMATH Open document ID: 0802.90077
DOI: 10.1016/0166-218X(94)90209-7
author: Arnaud Fréville
author: Gérard Plateau
published in: Discrete Applied Mathematics
publication date: 1994-06-15T00:00:00Z
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 590203
zbMATH Keywords: heuristics
zbMATH Keywords: relaxation
zbMATH Keywords: reduction
zbMATH Keywords: multidimensional 0-1 knapsack problem
zbMATH Keywords: multiple resource constraints
MaRDI profile type: Publication
cites work: Pivot and Complement–A Heuristic for 0-1 Programming
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: Q3241581
cites work: Coefficient reduction for inequalities in 0–1 variables
cites work: Q4133397
cites work: Hard Knapsack Problems
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: Calculating surrogate constraints
cites work: An algorithm for the solution of the 0-1 knapsack problem
cites work: Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
cites work: An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
cites work: Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
cites work: A descent algorithm for nonsmooth convex optimization
cites work: Q3214706
cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
cites work: An Improved Implicit Enumeration Approach for Integer Programming
cites work: Q4178782
cites work: The Theory and Computation of Knapsack Functions
cites work: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
cites work: Surrogate Mathematical Programming
cites work: Constraint Pairing In Integer Programming
cites work: Validation of subgradient optimization
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Reduction Algorithm for Zero-One Single Knapsack Problems
cites work: Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
cites work: An aggregate subgradient method for nonsmooth convex minimization
cites work: Q3738946
cites work: Q3320130
cites work: Fast Approximation Algorithms for Knapsack Problems
cites work: Q4182270
cites work: A Note on Approximation Schemes for Multidimensional Knapsack Problems
cites work: A fully polynomial approximation algorithm for the 0-1 knapsack problem
cites work: On the Solution of Discrete Programming Problems
cites work: A New Algorithm for the 0-1 Knapsack Problem
cites work: Heuristic algorithms for the multiple knapsack problem
cites work: A heuristic solution procedure for the multiconstraint zero-one knapsack problem
cites work: Q3993469
cites work: Surrogate duality in a branch-and-bound procedure for integer programming
cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
cites work: Q5187067
cites work: Zero-one programming with many variables and few constraints
cites work: Dynamic programming algorithms for the zero-one knapsack problem
cites work: Heuristic methods and applications: A categorized survey
description: scientific article; zbMATH DE number 590203