ausblenden:
Schlagwörter:
-
Zusammenfassung:
We provide analogues of Carathéodory's theorem for integer cones and apply our
bounds to integer programming and to the cutting stock problem. In particular,
we provide an NP certificate for the latter, whose existence has not been known
so far.