The multidimensional 0-1 knapsack problem: an overview.
From MaRDI portal
Publication:1428041
Recommendations
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- The multidimensional knapsack problem: structure and algorithms
- Improved results on the 0--1 multidimensional knapsack problem
- When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners
Cites work
- scientific article; zbMATH DE number 3644795 (Why is no real title available?)
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3850828 (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 4087427 (Why is no real title available?)
- scientific article; zbMATH DE number 3550466 (Why is no real title available?)
- scientific article; zbMATH DE number 3559281 (Why is no real title available?)
- scientific article; zbMATH DE number 1054947 (Why is no real title available?)
- scientific article; zbMATH DE number 1054949 (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?)
- (1,k)-configurations and facets for packing problems
- 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 framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems
- 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 revised bound improvement sequence algorithm
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- A statistical analysis of the knapsack problem
- Algorithms for the Simple Plant-Location Problem with Some Side Conditions
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- An Algorithm for Large Zero-One Knapsack Problems
- An Approach to Solving Linear Discrete Optimization Problems
- An Enumeration Algorithm for Knapsack Problems
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
- An Improved Implicit Enumeration Approach for Integer Programming
- An algorithm for the solution of the 0-1 knapsack problem
- 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
- Branch and Bound Methods for Mathematical Programming Systems
- 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
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- Discrete Programming by the Filter Method
- Discrete dynamic programming and capital allocation
- 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
- Exact solution of multicommodity network optimization problems with general step cost functions
- Experimental results on Hillier's linear search
- 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
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods
- Heuristic algorithms for the multiple knapsack problem
- Heuristic analysis, linear programming and branch and bound
- Heuristic improvement methods: How should starting solutions be chosen?
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- Integer Linear Programming: A Study in Computational Efficiency
- Interior Path Methods for Heuristic Integer Programming Procedures
- Local search with memory: Benchmarking RTS
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- MINTO, a Mixed INTeger Optimizer
- Minimum partition of a matroid into independent subsets
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach
- 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
- Solution of Integer Linear Programming Problems by Direct Search
- Solution of the Lorie-Savage and Similar Integer Programming Problems by the Generalized Lagrange Multiplier Method
- 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
- 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 Traveling-Salesman Problem and Minimum Spanning Trees
- The bound improving sequence algorithm
- 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 noising method: A new method for combinatorial optimization
- The traveling-salesman problem and minimum spanning trees: Part II
- 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
(90)- Scheduling orders for multiple product types with due date related objectives
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- Hybrid approaches for the two-scenario max-min knapsack problem
- Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
- The multidimensional knapsack problem: structure and algorithms
- An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities
- A randomized heuristic repair for the multidimensional knapsack problem
- Memory and learning in metaheuristics
- A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP)
- Revisiting surrogate relaxation for the multidimensional knapsack problem
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- Adaptive memory search for multidemand multidimensional knapsack problems
- A multidimensional knapsack model for asset-backed securitization
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- An ant colony optimization approach for binary knapsack problem under fuzziness
- Optimal selection of touristic packages based on user preferences during sports mega-events
- Scatter search for the 0-1 multidimensional knapsack problem
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- Experiments concerning sequential versus simultaneous maximization of objective function and distance
- Bi-dimensional knapsack problems with one soft constraint
- Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
- Allocation of advertising space by a web service provider using combinatorial auctions
- Dual inequalities for stabilized column generation revisited
- Greedy algorithm for the general multidimensional knapsack problem
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
- An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem
- Exploiting nested inequalities and surrogate constraints
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
- A new exact approach for the 0-1 collapsing knapsack problem
- Heuristics for the 0-1 multidimensional knapsack problem
- A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
- New convergent heuristics for 0-1 mixed integer programming
- Intelligent water drops algorithm
- Improved results on the 0--1 multidimensional knapsack problem
- Counting and enumerating independent sets with applications to combinatorial optimization problems
- An exact algorithm for the reliability redundancy allocation problem
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
- The minmax multidimensional knapsack problem with application to a chance‐constrained problem
- Resource allocation based on redundancy models for high availability cloud
- A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
- An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters
- Algorithmic aspects for power-efficient hardware/software partitioning
- Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- On structural parameterizations of the bounded-degree vertex deletion problem
- Some new results on multi-dimension Knapsack problem
- The basic train makeup problem in shunting yards
- The complexity of the 0/1 multi-knapsack problem
- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
- Optimal allocation of buffer times to increase train schedule robustness
- Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem
- An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- A RNN-based hyper-heuristic for combinatorial problems
- Discrete dynamical system approaches for Boolean polynomial optimization
- A deep real options policy for sequential service region design and timing
- Modeling multiple plant sourcing decisions
- Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints
- Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence
- Placement optimization in refugee resettlement
- The multiple multidimensional knapsack with family-split penalties
- Two-dimensional knapsack-block packing problem
- Target-based computer-assisted orchestration: complexity and approximation algorithms
- Logic Gate-based Evolutionary Algorithm for the multidimensional knapsack problem-wireless sensor network application
- 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®
- Convexity and solutions of stochastic multidimensional 0-1 knapsack problems with probabilistic constraints
- The restrict merger approach of a kind of multidimensional 0-1 knapsack problem
- On structural parameterizations of the bounded-degree vertex deletion problem
- A decomposition approach for multidimensional knapsacks with family‐split penalties
- Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
- Dichotomous binary differential evolution for knapsack problems
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners
- Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
This page was built for publication: The multidimensional 0-1 knapsack problem: an overview.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1428041)
