Sensitivity analysis of the knapsack sharing problem : Perturbation of the weight of an itemBELGACEM, T; HIFI, M.Computers & operations research. 2008, Vol 35, Num 1, pp 295-308, issn 0305-0548, 14 p.Article

An exact algorithm for the knapsack sharing problem with common itemsFUJIMOTO, Masako; YAMADA, Takeo.European journal of operational research. 2006, Vol 171, Num 2, pp 693-707, issn 0377-2217, 15 p.Article

Core problems in bi-criteria {0, 1}-knapsack problemsDA SILVA, Carlos Gomes; CLIMACO, Joao; FIGUEIRA, Jose Rui et al.Computers & operations research. 2008, Vol 35, Num 7, pp 2292-2306, issn 0305-0548, 15 p.Article

A polyhedral study of the cardinality constrained knapsack problemDE FARIAS, I. R; NEMHAUSER, G. L.Mathematical programming. 2003, Vol 96, Num 3, pp 439-467, issn 0025-5610, 29 p.Article

The average behaviour of greedy algorithms for the knapsack problem: General distributionsDIUBIN, Gennady; KORBUT, Alexander.Mathematical methods of operations research (Heidelberg). 2003, Vol 57, Num 3, pp 449-479, issn 1432-2994, 31 p.Article

An improved branch and bound algorithm for a strongly correlated unbounded knapsack problemSEONG, Y-J; G, Y-G; KANG, M-K et al.The Journal of the Operational Research Society. 2004, Vol 55, Num 5, pp 547-552, issn 0160-5682, 6 p.Article

Improved dynamic programming in connection with an FPTAS for the knapsack problemKELLERER, Hans; PFERSCHY, Ulrich.Journal of combinatorial optimization. 2004, Vol 8, Num 1, pp 5-11, issn 1382-6905, 7 p.Article

Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary knapsack problemHIFI, Mhand; MHALLA, Hedi; SADFI, Slim et al.Journal of combinatorial optimization. 2005, Vol 10, Num 3, pp 239-260, issn 1382-6905, 22 p.Article

An optimization algorithm for a penalized knapsack problemCESELLI, Alberto; RIGHINI, Giovanni.Operations research letters. 2006, Vol 34, Num 4, pp 394-404, issn 0167-6377, 11 p.Article

Computational experience with a core-based reduction procedure for the 2-knapsack problemCROCE, F. Della; GROSSO, A.Computers & operations research. 2011, Vol 38, Num 2, pp 514-516, issn 0305-0548, 3 p.Article

A reactive local search-based algorithm for the disjunctively constrained knapsack problemHIFI, M; MICHRAFY, M.The Journal of the Operational Research Society. 2006, Vol 57, Num 6, pp 718-726, issn 0160-5682, 9 p.Article

A constructive periodicity bound for the unbounded knapsack problemHUANG, Ping H; TANG, Kwei.Operations research letters. 2012, Vol 40, Num 5, pp 329-331, issn 0167-6377, 3 p.Article

The one dimensional Compartmentalised Knapsack Problem : A case study : Cutting and PackingHOTO, Robinson; ARENALES, Marcos; MACULAN, Nelson et al.European journal of operational research. 2007, Vol 183, Num 3, pp 1183-1195, issn 0377-2217, 13 p.Article

Knapsack problems for NLJENNER, B.Information processing letters. 1995, Vol 54, Num 3, pp 169-174, issn 0020-0190Article

Heuristic algorithms for the multiple-choice multidimensional knapsack problemHIFI, M; MICHRAFY, M; SBIHI, A et al.The Journal of the Operational Research Society. 2004, Vol 55, Num 12, pp 1323-1332, issn 0160-5682, 10 p.Article

Online knapsack with resource augmentationIWAMA, Kazuo; GUOCHUAN ZHANG.Information processing letters. 2010, Vol 110, Num 22, pp 1016-1020, issn 0020-0190, 5 p.Article

An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problemWILBAUT, Christophe; SALHI, Saïd; HANAFI, Said et al.European journal of operational research. 2009, Vol 199, Num 2, pp 339-348, issn 0377-2217, 10 p.Article

Non-injective knapsack public-key cryptosystemsKOSKINEN, Jukka A.Theoretical computer science. 2001, Vol 255, Num 1-2, pp 401-422, issn 0304-3975Article

Solving the knapsack problem with imprecise weight coefficients using genetic algorithmsLIN, Feng-Tse.European journal of operational research. 2008, Vol 185, Num 1, pp 133-145, issn 0377-2217, 13 p.Article

La Réduction des Réseaux en Crytographie = Lattice reduction in CryptographyJoux, Antoine; Stern, Jacques.1993, 82 p.Thesis

Yet harder knapsack problemsJUKNA, Stasys; SCHNITGER, Georg.Theoretical computer science. 2011, Vol 412, Num 45, pp 6351-6358, issn 0304-3975, 8 p.Article

A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack ProblemSBIHI, Abdelkader.European journal of operational research. 2010, Vol 202, Num 2, pp 339-346, issn 0377-2217, 8 p.Article

Selection among ranked projects under segmentation, policy and logical constraintsMAVROTAS, George; DIAKOULAKI, Danae; KOURENTZIS, Athanasios et al.European journal of operational research. 2008, Vol 187, Num 1, pp 177-192, issn 0377-2217, 16 p.Article

Approximation of min-max and min-max regret versions of some combinatorial optimization problemsAISSI, Hassene; BAZGAN, Cristina; VANDERPOOTEN, Daniel et al.European journal of operational research. 2007, Vol 179, Num 2, pp 281-290, issn 0377-2217, 10 p.Article

Partially ordered knapsack and applications to schedulingKOLLIOPOULOS, Stavros G; STEINERB, George.Discrete applied mathematics. 2007, Vol 155, Num 8, pp 889-897, issn 0166-218X, 9 p.Article