Terno J.

J. Terno

Information about the author J. Terno will soon be added to the site.
Found 5 papers in total
Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
2001
When solving the one-dimensional cutting stock problem (1D CSP) as an integer linear...
Facet-defining inequalities for the cutting stock problem
Facet-defining inequalities for the cutting stock problem
1999
In this paper the polyhedron of the cutting stock problem is investigated with respect...
New cases of the cutting stock problem having MIRUP
New cases of the cutting stock problem having MIRUP
1998
The modified integer round-up property (MIRUP) for a linear integer minimization...
A polynomial time algorithm for the guillotine pallet loading problem
A polynomial time algorithm for the guillotine pallet loading problem
1994
A polynomial time algorithm is presented for solving the two-dimensional guillotine...
Modelling of packing problems
Modelling of packing problems
1993
In this paper the modeling of packing problems (cutting and allocation problems) is...
Papers per page: