Jürgen Rietz

12 papers C 1Journal 9Unranked 2
YearRankTypeTitle / Venue / Authors
2016 J jnl
An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling.
Comput. Oper. Res.
Jürgen Rietz, Cláudio Alves, Nuno Braga, José M. Valério de Carvalho
2015 J jnl
Constructing general dual-feasible functions.
Oper. Res. Lett.
Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux
2015 — conf
Fast Heuristics for Integrated Planning and Scheduling.
ICCSA (2)
Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho
2014 J jnl
Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem.
Eur. J. Oper. Res.
Cláudio Alves, José M. Valério de Carvalho, François Clautiaux, Jürgen Rietz
2014 — conf
On the Properties of General Dual-Feasible Functions.
ICCSA (2)
Jürgen Rietz, Cláudio Alves, José Manuel Valério de Carvalho, François Clautiaux
2012 C conf
Computing Valid Inequalities for General Integer Programs using an Extension of Maximal Dual Feasible Functions to Negative Arguments.
ICORES
Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux
2012 J jnl
On the extremality of maximal dual feasible functions.
Oper. Res. Lett.
Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho
2012 J jnl
Worst-case analysis of maximal dual feasible functions.
Optim. Lett.
Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho
2011 J jnl
New Stabilization Procedures for the Cutting Stock Problem.
INFORMS J. Comput.
François Clautiaux, Cláudio Alves, José M. Valério de Carvalho, Jürgen Rietz
2010 J jnl
Theoretical investigations on maximal dual feasible functions.
Oper. Res. Lett.
Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho
2008 J jnl
Large gaps in one-dimensional cutting stock problems.
Discret. Appl. Math.
Jürgen Rietz, Stephan Dempe
2002 J jnl
Families of non-IRUP instances of the one-dimensional cutting stoc problem.
Discret. Appl. Math.
Jürgen Rietz, Guntram Scheithauer, Johannes Terno