David Pisinger  Home/Search
Context Related
| diku.dk/users/pisinger/95Y.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: diku.dk/users/pisinger/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A new branch-and-bound algorithm for the exact solution of the 0-1 Knapsack Problem is presented. The algorithm is based on solving an "expanding core", which initially only contains the break item, but which is expanded each time the branch-and-bound algorithm reaches the border of the core. Computational experiments show that most data instances are optimally solved without sorting or preprocessing a great majority of the items. Detailed program sketches are provided, and computational... (Update)
Context of citations to this paper: More
.... the art techniques to solve the KP would focus on a so called core problem, which may be extended during the optimization process (see [12, 17]) For these modern algorithms it is not straight forward to see how the reduction algorithm we present in the following could be...
...main computational e ort is to order the items according to nondecreasing weights. But if we perform the ordering by need as described in [7] then several large sized instances may be solved without ordering more than a couple of items, meaning that these instances are...
Cited by: More
The Core Concept for the Multidimensional - Knapsack Problem Jakob (Correct)
Cost based Filtering for the - Constrained Knapsack Problem (Correct)
An O(nr) algorithm for the Subset-sum Problem - and other.. - Pisinger (Correct)
Similar documents (at the sentence level):
38.5%: Algorithms for Knapsack Problems - Pisinger (1995) (Correct)
Similar documents based on text: More All
0.5: Budgeting with Bounded Multiple-choice Constraints - Pisinger (1999) (Correct)
0.4: New Trends in Exact Algorithms for the 0-1 Knapsack Problem - Martello, Pisinger, Toth (1997) (Correct)
0.4: Exact Solution of the Quadratic Knapsack Problem - Caprara, Pisinger, Toth (1998) (Correct)
Related documents from co-citation: More All
3: Upper Bounds and Algorithms for hard 0-1 knapsack problems (context) - Martello, Toth - 1997
3: A reduction algorithm for knapsack problems (context) - Dembo, Hammer - 1980
3: A new algorithm for the 0-1 knapsack problem (context) - Martello, Toth - 1988
BibTeX entry: (Update)
D. Pisinger. An expanding-core algorithm for the exact 0-1 knapsack problem. European Journal of Operational Research, 87:175-187, 1995. http://citeseer.ist.psu.edu/pisinger93expandingcore.html More
@misc{ pisinger95expandingcore,
author = "D. Pisinger",
title = "An expanding-core algorithm for the exact 0-1 knapsack problem",
text = "D. Pisinger. An expanding-core algorithm for the exact 0-1 knapsack problem.
European Journal of Operational Research, 87:175-187, 1995.",
year = "1995",
url = "citeseer.ist.psu.edu/pisinger93expandingcore.html" }
Citations not processed or no citations identified.
Documents on the same site (http://www.diku.dk/users/pisinger/): More
Dynamic programming on the word RAM - Pisinger (Correct)
Discrete Location Problems With Push-Pull Objectives - Krarup, Pisinger, Plastria (1999) (Correct)
An Exact Algorithm for Large Multiple Knapsack Problems - Pisinger (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC