The multidimensional 0-1 knapsack problem -- bounds and computational aspects
From MaRDI portal
Recommendations
- The multidimensional 0-1 knapsack problem: an overview.
- Heuristics for the 0-1 multidimensional knapsack problem
- The multidimensional knapsack problem: structure and algorithms
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
Cites work
- scientific article; zbMATH DE number 3644795 (Why is no real title available?)
- scientific article; zbMATH DE number 3900494 (Why is no real title available?)
- scientific article; zbMATH DE number 4072712 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 1054947 (Why is no real title available?)
- scientific article; zbMATH DE number 1054950 (Why is no real title available?)
- scientific article; zbMATH DE number 1054952 (Why is no real title available?)
- scientific article; zbMATH DE number 1114464 (Why is no real title available?)
- scientific article; zbMATH DE number 3323527 (Why is no real title available?)
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A Minimal Algorithm for the Bounded Knapsack Problem
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- A New Algorithm for the 0-1 Knapsack Problem
- A Note on Approximation Schemes for Multidimensional Knapsack Problems
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- A class of generalized greedy algorithms for the multi-knapsack problem
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- A hybrid approach to discrete mathematical programming
- A hybrid search combining interior point methods and metaheuristics for 0-1 programming
- A note on the pivot and complement heuristic for 0-1 programming problems
- A probabilistic analysis of the multiknapsack value function
- A recursive branch and bound algorithm for the multidimensional knapsack problem
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- A statistical analysis of the knapsack problem
- An Algorithm for Large Zero-One Knapsack Problems
- An Enumeration Algorithm for Knapsack Problems
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
- An expanding-core algorithm for the exact 0-1 knapsack problem
- Approximate Algorithms for the 0/1 Knapsack Problem
- Approximate algorithms for some generalized knapsack problems
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- Balancing and optimizing a portfolio of R&D projects
- Calculating surrogate constraints
- Capital Budgeting Under Uncertainty—An Integrated Approach Using Contingent Claims Analysis and Integer Programming
- Coefficient reduction for inequalities in 0–1 variables
- Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
- Constraint Pairing In Integer Programming
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- Dynamic tabu list management using the reverse elimination method
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Efficient reformulation for 0-1 programs -- methods and computational results
- Exact solution of multicommodity network optimization problems with general step cost functions
- Extension of reverse elimination method through a dynamic management of the tabu list
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Future paths for integer programming and links to artificial intelligence
- Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
- Heuristic analysis, linear programming and branch and bound
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- Lagrangean decomposition for integer programming : theory and applications
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Local search with memory: Benchmarking RTS
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- MINTO, a Mixed INTeger Optimizer
- MIP: Theory and practice -- closing the gap
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Octane: A New Heuristic for Pure 0–1 Programs
- On The Strength Of Relaxations Of Multidimensional Knapsack Problems
- On rates of convergence and asymptotic normality in the multiknapsack problem
- On the Solution of Discrete Programming Problems
- On the growth of random knapsacks
- Pivot and Complement–A Heuristic for 0-1 Programming
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Probabilistic Analysis of the Multidimensional Knapsack Problem
- Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Random knapsacks with many constraints
- Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
- Solving Large-Scale Zero-One Linear Programming Problems
- Solving zero-one mixed integer programming problems using tabu search
- Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms
- Some relationships between lagrangian and surrogate duality in integer programming
- Statistical mechanics of the knapsack problem
- Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions
- Surrogate Constraint Duality in Mathematical Programming
- Surrogate Constraints
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- Surrogate Mathematical Programming
- Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
- Tabu Search—Part I
- Tabu search for the multilevel generalized assignment problem
- Tabu search within a pivot and complement framework
- Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
- The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The Reactive Tabu Search
- The Theory and Computation of Knapsack Functions
- The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance
- The growth of m-constraint random knapsacks
- The growth of multi-constraint random knapsack with various right-hand sides of the constraints
- The growth of multi-constraint random knapsacks with large right-hand sides of the constraints
- The multidimensional 0-1 knapsack problem: an overview.
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
- Worst-Case Analysis of Heuristic Algorithms
- Zero-one programming with many variables and few constraints
Cited in
(62)- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
- Two-dimensional knapsack-block packing problem
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- The minmax multidimensional knapsack problem with application to a chance‐constrained problem
- A novel multi-objective approach for link selection in aeronautical telecommunication networks
- Studying properties of Lagrangian bounds for many-to-many assignment problems
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem
- Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes
- The restrict merger approach of a kind of multidimensional 0-1 knapsack problem
- Consistency cuts for Dantzig-Wolfe reformulations
- Exploiting nested inequalities and surrogate constraints
- Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
- An application of the multiple knapsack problem: the self-sufficient marine
- Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
- Refinement of Lagrangian bounds in optimization problems
- Surrogate dual method for multi-dimensional nonlinear knapsack problems
- Hybrid approaches for the two-scenario max-min knapsack problem
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- Lower Bounds on Time-Accuracy Trade-Offs for the 0-1 Knapsack Problem
- The multiple multidimensional knapsack with family-split penalties
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Scatter search for the 0-1 multidimensional knapsack problem
- A branch-and-price-and-cut algorithm for operating room scheduling under human resource constraints
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- Computing and Selecting ε-Efficient Solutions of {0, 1}-Knapsack Problems
- Convexity and solutions of stochastic multidimensional 0-1 knapsack problems with probabilistic constraints
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Some new results on multi-dimension Knapsack problem
- The fractional multidimensional knapsack problem: solution and uniqueness
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- A Lagrangian bound for many-to-many assignment problems
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- Hard multidimensional multiple choice knapsack problems, an empirical study
- When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners
- Computational study of surrogate dual method for multi-dimensional nonlinear Knapsack problems
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
- Problem reduction heuristic for the 0-1 multidimensional knapsack problem
- Strong formulation for the spot 5 daily photograph scheduling problem
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- Revisiting surrogate relaxation for the multidimensional knapsack problem
- A multidimensional knapsack model for asset-backed securitization
- Multicriteria 0-1 knapsack problems with \(k\)-min objectives
- New convergent heuristics for 0-1 mixed integer programming
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX®
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP)
- The multidimensional knapsack problem: structure and algorithms
- Memory and learning in metaheuristics
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
- Some computational results on real 0-1 knapsack problems
- Comment on 'Some computational results on real 0-1 knapsack problems'
This page was built for publication: The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817185)
