New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems
Year of publication: |
2009
|
---|---|
Authors: | Tamir, Arie |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 37.2009, 5, p. 303-306
|
Subject: | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Operations Research | Operations research |
-
Exact algorithms for a bandwidth packing problem with queueing delay guarantees
Han, Jinil, (2013)
-
Hochbaum, Dorit S., (2019)
-
An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines
Koulamas, Christos, (2008)
- More ...
-
Minimality and Complementarity Properties Associated with Z-Functions and M-Functions
Tamir, Arie, (1974)
-
Line Search Techniques Based on Interpolating Polynomials Using Function Values Only
Tamir, Arie, (1974)
-
Pre-Leontief Functions and Least Elements
Tamir, Arie, (1975)
- More ...