Discrete Applied Mathematics

Preface
pp. 1-2(2)
Authors: Malucelli F.; Maffioli F.

On some difficult linear programs coming from set partitioning
pp. 3-11(9)
Authors: Barahona F.; Anbil R.

A lower bound for the non-oriented two-dimensional bin packing problem
pp. 13-24(12)
Authors: Dell'Amico M.; Martello S.; Vigo D.

Finding the &unknown;-core of a tree
pp. 25-42(18)
Authors: Becker R.I.; Chang Y.I.; Lari I.; Scozzari A.; Storchi G.

Variable neighborhood search for the degree-constrained minimum spanning tree problem
pp. 43-54(12)
Authors: Ribeiro C.C.; Souza¹ M.C.

Short trees in polygons
pp. 55-72(18)
Authors: Winter¹ P.; Zachariasen¹ M.; Nielsen J.

On the approximation of the Minimum Disturbance p-Facility Location Problem
pp. 73-83(11)
Author: Galbiati G.

Efficient generation of rotating workforce schedules
pp. 85-98(14)
Authors: Musliu¹ N.; Gartner J.; Slany² W.

Optimally balancing assembly lines with different workstations
pp. 99-113(15)
Authors: Nicosia G.; Pacciarelli D.; Pacifici A.

The MIN PFS problem and piecewise linear model estimation
pp. 115-143(29)
Authors: Amaldi E.; Mattavelli M.

Inverse radiation therapy planning - a multiple objective optimization approach
pp. 145-161(17)
Authors: Hamacher¹ H.W.; Kufer K.-H.