Polynomial size IP formulations of knapsack may require exponentially large coefficients

Christopher Hojny

Year of publication:	2020
Authors:	Hojny, Christopher
Published in:	Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 48.2020, 5, p. 612-618
Subject:	Integer programming formulation \| Knapsack polytope \| Size of coefficients \| Ganzzahlige Optimierung \| Integer programming \| Theorie \| Theory \| Mathematische Optimierung \| Mathematical programming \| Betriebsgröße \| Firm size

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10012303424

A service of the