The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(10 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MINTO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OSL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Octane / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-005-3448-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968838253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the pivot and complement heuristic for 0-1 programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Octane: A New Heuristic for Pure 0–1 Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot and Complement–A Heuristic for 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Reactive Tabu Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search with memory: Benchmarking RTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing and optimizing a portfolio of R&D projects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coefficient reduction for inequalities in 0–1 variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Enumeration Algorithm for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate algorithms for some generalized knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On The Strength Of Relaxations Of Multidimensional Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic tabu list management using the reverse elimination method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient reformulation for 0-1 programs -- methods and computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing approach to the multiconstraint zero-one knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating surrogate constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of the Multidimensional Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Heuristic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A statistical analysis of the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multidimensional 0-1 knapsack problem: an overview. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics and reduction methods for multiple constraints 0-1 linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of multicommodity network optimization problems with general step cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rates of convergence and asymptotic normality in the multiknapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory and Computation of Knapsack Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraint Duality in Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean decomposition for integer programming : theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Pairing In Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient tabu search approach for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4377048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Heuristic Procedures for Integer Linear Programming with an Interior / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some relationships between lagrangian and surrogate duality in integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Dual Multiplier Search Procedures in Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for the multilevel generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Search Algorithms for Zero-One and Mixed-Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving zero-one mixed integer programming problems using tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search within a pivot and complement framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Approximation Schemes for Multidimensional Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial approximation algorithm for the 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for the multidimensional zero-one knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the growth of random knapsacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Solution of Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid approach to discrete mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New trends in exact algorithms for the \(0-1\) knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic analysis of the multiknapsack value function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capital Budgeting Under Uncertainty—An Integrated Approach Using Contingent Claims Analysis and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINTO, a Mixed INTeger Optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic solution procedure for the multiconstraint zero-one knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An expanding-core algorithm for the exact \(0-1\) knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal Algorithm for the Bounded Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid search combining interior point methods and metaheuristics for 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3678962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of generalized greedy algorithms for the multi-knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The growth of m-constraint random knapsacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random knapsacks with many constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Algorithms for the 0/1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-one programming with many variables and few constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The growth of multi-constraint random knapsack with various right-hand sides of the constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The growth of multi-constraint random knapsacks with large right-hand sides of the constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive branch and bound algorithm for the multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A ``logic-constrained'' knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic analysis, linear programming and branch and bound / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:45, 24 June 2024

scientific article
Language Label Description Also known as
English
The multidimensional 0-1 knapsack problem -- bounds and computational aspects
scientific article

    Statements

    The multidimensional 0-1 knapsack problem -- bounds and computational aspects (English)
    0 references
    0 references
    0 references
    7 March 2006
    0 references
    multidimensional 0-1 knapsack problem
    0 references
    heuristics and metaheuristics
    0 references
    probabilistic and worstcase analysis
    0 references
    surrogate and composite duality
    0 references
    preprocessing
    0 references
    MIP solvers
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers