Results 141 to 150 of about 36,372,437 (161)

Lifting valid inequalities for the precendence constrained knapsack problem. [PDF]

Klundert, J.J. van de, Leensel, R.L.M.J. van de, Hoesel, C.P.M. van   +2 more
core  

Some of the next articles are maybe not open access.

Related searches:

A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts

European Journal of Operational Research, 2021
Pablo San Segundo Carrillo, Stefano Coniglio, Fabio Furini   +2 more
exaly  

A Minimal Algorithm for the 0-1 Knapsack Problem

Operations Research, 1997
David Pisinger
exaly  

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

Management Science, 1999
Silvano Martello, David Pisinger
exaly  

A minimal algorithm for the multiple-choice knapsack problem

European Journal of Operational Research, 1995
David Pisinger
exaly  

A New Algorithm for the 0-1 Knapsack Problem

Management Science, 1988
Silvano Martello
exaly  

Exact Solution of the Quadratic Knapsack Problem

INFORMS Journal on Computing, 1999
Paolo Toth, David Pisinger, Alberto Caprara   +2 more
exaly  

A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph

INFORMS Journal on Computing, 2017
Andrea Bettinelli, Enrico Malaguti, Valentina Cacchiani   +2 more
exaly  

The Multidimensional Knapsack Problem: Structure and Algorithms

INFORMS Journal on Computing, 2010
Jakob Puchinger, Ulrich Pferschy, Guenther Raidl   +2 more
exaly  

A nonlinear Knapsack problem

Operations Research Letters, 1995
Dorit S. Hochbaum
exaly