Families of non-IRUP instances of the one-dimensional cutting stoc problem. - Jürgen Rietz; Guntram Scheithauer; Johannes Terno (Discret. Appl. Math., 2002)

Large gaps in one-dimensional cutting stock problems. - Jürgen Rietz; Stephan Dempe (Discret. Appl. Math., 2008)

Theoretical investigations on maximal dual feasible functions. - Jürgen Rietz; Cláudio Alves; José M. Valério de Carvalho (Oper. Res. Lett., 2010)

New Stabilization Procedures for the Cutting Stock Problem. - François Clautiaux; Cláudio Alves; José M. Valério de Carvalho; Jürgen Rietz (INFORMS J. Comput., 2011)

Computing Valid Inequalities for General Integer Programs using an Extension of Maximal Dual Feasible Functions to Negative Arguments. - Jürgen Rietz; Cláudio Alves; José M. Valério de Carvalho; François Clautiaux (ICORES, 2012)

Worst-case analysis of maximal dual feasible functions. - Jürgen Rietz; Cláudio Alves; José M. Valério de Carvalho (Optim. Lett., 2012)

On the extremality of maximal dual feasible functions. - Jürgen Rietz; Cláudio Alves; José M. Valério de Carvalho (Oper. Res. Lett., 2012)

On the Properties of General Dual-Feasible Functions. - Jürgen Rietz; Cláudio Alves; José Manuel Valério de Carvalho; François Clautiaux (ICCSA (2), 2014)

Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem. - Cláudio Alves; José M. Valério de Carvalho; François Clautiaux; Jürgen Rietz (Eur. J. Oper. Res., 2014)

Fast Heuristics for Integrated Planning and Scheduling. - Jürgen Rietz; Cláudio Alves; José M. Valério de Carvalho (ICCSA (2), 2015)

Constructing general dual-feasible functions. - Jürgen Rietz; Cláudio Alves; José M. Valério de Carvalho; François Clautiaux (Oper. Res. Lett., 2015)

An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling. - Jürgen Rietz; Cláudio Alves; Nuno Braga; José M. Valério de Carvalho (Comput. Oper. Res., 2016)