Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

Authors:
Silvano Martello;David Pisinger;Paolo Toth
Affiliations:
-;-;-
Venue:
Management Science
Year:
1999

Citing 0
Cited 42

Input models for synthetic optimization problems

Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 1
Designing Least-Cost Survivable Wireless Backhaul Networks

Journal of Heuristics
An exact algorithm for the knapsack sharing problem

Computers and Operations Research
Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0--1 knapsack problem

Journal of Parallel and Distributed Computing
Where are the hard knapsack problems?

Computers and Operations Research
A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem

Computational Optimization and Applications
Hybrid approaches for classification under information acquisition cost constraint

Decision Support Systems
A data mining-constraint satisfaction optimization problem for cost effective classification

Computers and Operations Research
Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem

Computers and Operations Research
Algorithms for solving the single-sink fixed-charge transportation problem

Computers and Operations Research
Core problems in bi-criteria {0,1}-knapsack problems

Computers and Operations Research
Automating branch-and-bound for dynamic programs

PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Synthetic Optimization Problem Generation: Show Us the Correlations!

INFORMS Journal on Computing
Using machine learning in a cooperative hybrid parallel strategy of metaheuristics

Information Sciences: an International Journal
Hybrid approaches for classification under information acquisition cost constraint

Decision Support Systems
Combining Lagrangian decomposition with an evolutionary algorithm for the knapsack constrained maximum spanning tree problem

EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Enhanced quantum evolutionary algorithms for difficult knapsack problems

PReMI'07 Proceedings of the 2nd international conference on Pattern recognition and machine intelligence
The accuracy of search heuristics: an empirical study on knapsack problems

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Lock-free parallel dynamic programming

Journal of Parallel and Distributed Computing
Development of core to solve the multidimensional multiple-choice knapsack problem

Computers and Industrial Engineering
A dynamic Island-based genetic algorithms framework

SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning
Simulating realistic set covering problems with known optimal solutions

Computers and Industrial Engineering
Review: Measuring instance difficulty for combinatorial optimization problems

Computers and Operations Research
An exact algorithm for the 0---1 linear knapsack problem with a single continuous variable

Journal of Global Optimization
Branch-and-Cut-and-Price for Capacitated Connected Facility Location

Journal of Mathematical Modelling and Algorithms
Facing dynamic optimization using a cooperative metaheuristic configured via fuzzy logic and SVMs

Applied Soft Computing
Wisdom of artificial crowds algorithm for solving NP-hard problems

International Journal of Bio-Inspired Computation
LP bounds in various constraint programming approaches for orthogonal packing

Computers and Operations Research
A revenue-aware bandwidth allocation model and algorithm in IP networks

ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems
Solving the hard knapsack problems with a binary particle swarm approach

ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
An efficient algorithm for the collapsing knapsack problem

Information Sciences: an International Journal
Variable neighborhood and greedy randomized adaptive search for capacitated connected facility location

EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
A 0-1 knapsack model for evaluating the possible Electoral College performance in two-party US presidential elections

Mathematical and Computer Modelling: An International Journal
An optimization algorithm for a penalized knapsack problem

Operations Research Letters
The bilevel knapsack problem with stochastic right-hand sides

Operations Research Letters
A dynamic programming algorithm for the bilevel knapsack problem

Operations Research Letters
Note: Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem

Discrete Optimization
A hybrid algorithm for the unbounded knapsack problem

Discrete Optimization
Optimal selection of media vehicles using customer databases

Expert Systems with Applications: An International Journal
A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem

INFORMS Journal on Computing
Exact solution of the robust knapsack problem

Computers and Operations Research
Lower and upper bounds for the Bin Packing Problem with Fragile Objects

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

Two new algorithms recently proved to outperform all previous methods for the exact solution of the 0-1 Knapsack Problem. This paper presents a combination of such approaches, where, in additi on, valid inequalities are generated and surrogate relaxed, and a new initial core problem is adopted. The algorithm is able to solve all classical test instances, with up to 10,000 variables, in less than 0.2 seconds on a HP9000-735/99 computer. The C language implementation of the algorithm is available on the internet.