Pisinger David

David Pisinger

Information about the author David Pisinger will soon be added to the site.
Found 32 papers in total
A minimal algorithm for the 0–1 knapsack problem
A minimal algorithm for the 0–1 knapsack problem
1997
Several types of large-sized 0–1 Knapsack Problems (KP) may be easily solved,...
Exact solution of the quadratic knapsack problem
Exact solution of the quadratic knapsack problem
1999
The Quadratic Knapsack Problem (QKP) calls for maximizing a quadratic objective...
Dynamic programming and strong bounds for the 0–1 knapsack problem
Dynamic programming and strong bounds for the 0–1 knapsack problem
1999
Two new algorithms recently proved to outperform all previous methods for the exact...
An exact algorithm for large multiple knapsack problems
An exact algorithm for large multiple knapsack problems
1999
The Multiple Knapsack Problem (MKP) is the problem of assigning a subset of n items to...
An expanding-core algorithm for the exact 0–1 Knapsack Problem
An expanding-core algorithm for the exact 0–1 Knapsack Problem
1995
A new branch-and-bound algorithm for the exact solution of the 0–1 Knapsack...
Some thoughts on combinatorial optimisation
Some thoughts on combinatorial optimisation
1995
A group of young researchers from the ESI X summer school, HEC, Jouy-en-Josas 1994,...
Avoiding anomalies in the mt2 algorithm by Martello and Toth
Avoiding anomalies in the mt2 algorithm by Martello and Toth
1995
The mt 2 algorithm by Martello and Toth for the solution of large sized 0–1...
A minimal algorithm for the Multiple-Choice Knapsack Problem
A minimal algorithm for the Multiple-Choice Knapsack Problem
1995
The Multiple-Choice Knapsack Problem is defined as a 0–1 Knapsack Problem with...
Papers per page: