Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Knapsack problem")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 923

  • Page / 37
Export

Selection :

  • and

New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problemsTAMIR, Arie.Operations research letters. 2009, Vol 37, Num 5, pp 303-306, issn 0167-6377, 4 p.Article

The improvement of the knapsack cipherTHE ANH PHAM.Computer communications. 2011, Vol 34, Num 3, pp 342-343, issn 0140-3664, 2 p.Article

A robust approach to the chance-constrained knapsack problemKLOPFENSTEIN, Olivier; NACE, Dritan.Operations research letters. 2008, Vol 36, Num 5, pp 628-632, issn 0167-6377, 5 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

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 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

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

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

Approximation schemes for knapsack problems with shelf divisionsXAVIER, E. C; MIYAZAWA, F. K.Theoretical computer science. 2006, Vol 352, Num 1-3, pp 71-84, issn 0304-3975, 14 p.Article

Where are the hard knapsack problems?PISINGER, David.Computers & operations research. 2005, Vol 32, Num 9, pp 2271-2284, issn 0305-0548, 14 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

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

Applications de la réduction de réseaux et nouvelle cryptanalyse d'une fonction de hachage = Applications of reduction algorithms and a new attack of a hash function based on the knapsack compressive problemBournon, Loïc; Harari, S.1995, 115 p.Thesis

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

The stochastic knapsack problemROSS, K. W; TSANG, D. H. K.IEEE transactions on communications. 1989, Vol 37, Num 7, pp 740-747, issn 0090-6778, 8 p.Article

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

Modeling multiple plant sourcing decisionsCHERBAKA, Natalie S; MELLER, Russell D.International journal of production research. 2008, Vol 46, Num 18, pp 5165-5190, issn 0020-7543, 26 p.Article

Sacs à ods orthogonaux et sacs à dos divisibles = Orthogonal and divisible knapsacksHARARI, S.TS. Traitement du signal. 1992, Vol 9, Num 3, pp 273-279, issn 0765-0019Article

Approximating the Orthogonal Knapsack Problem for HypercubesHARREN, Rolf.Lecture notes in computer science. 2006, pp 238-249, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

Removable online knapsack problemsIWAMA, Kazuo; TAKETOMI, Shiro.Lecture notes in computer science. 2002, pp 293-305, issn 0302-9743, isbn 3-540-43864-5, 13 p.Conference Paper

The use of duality to improve the efficiency of methods of solving the quadratic knapsack problemKISELEV, V. D; SUKMANOV, S. A.Computational mathematics and mathematical physics. 1993, Vol 33, Num 2, pp 287-288, issn 0965-5425Article

Satisfiability problem and lattice basis problem = Problème de satisfaisabilité et problème de réseauxHusain, Dhiaiddin; Morel, H.1996, 88 p.Thesis

  • Page / 37