| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2023 | J | jnl |
INFORMS J. Comput.
|
| 2019 | J | jnl |
Eur. J. Oper. Res.
|
| 2019 | J | jnl |
Eur. J. Oper. Res.
|
| 2017 | J | jnl |
Eur. J. Oper. Res.
|
| 2016 | J | jnl |
Transp. Sci.
|
| 2016 | J | jnl |
ERCIM News
|
| 2016 | J | jnl |
PLoS Comput. Biol.
|
| 2015 | J | jnl |
Eur. J. Oper. Res.
|
| 2014 | J | jnl |
Manuf. Serv. Oper. Manag.
|
| 2014 | J | jnl |
Eur. J. Oper. Res.
|
| 2014 | — | ed. |
OR
|
| 2012 | J | jnl |
Math. Program.
|
| 2011 | J | jnl |
INFOR Inf. Syst. Oper. Res.
|
| 2011 | J | jnl |
Int. J. Intell. Def. Support Syst.
|
| 2010 | J | jnl |
Oper. Res.
|
| 2009 | J | jnl |
Oper. Res. Lett.
|
| 2008 | J | jnl |
Oper. Res. Lett.
|
| 2006 | J | jnl |
Eur. J. Oper. Res.
|
| 2006 | J | jnl |
Eur. J. Oper. Res.
|
| 2006 | J | jnl |
An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem.
Comput. Oper. Res.
|
| 2005 | J | jnl |
Oper. Res. Lett.
|
| 2005 | J | jnl |
Manag. Sci.
|
| 2005 | J | jnl |
Transp. Sci.
|
| 2004 | J | jnl |
Ann. Oper. Res.
|
| 2004 | J | jnl |
Transp. Sci.
|
| 2003 | J | jnl |
Oper. Res.
|
| 2003 | J | jnl |
Constraints An Int. J.
|
| 2003 | J | jnl |
J. Sched.
|
| 2002 | J | jnl |
J. Oper. Res. Soc.
|
| 2002 | J | jnl |
J. Oper. Res. Soc.
|
| 2001 | J | jnl |
Manag. Sci.
|
| 2001 | J | jnl |
Math. Oper. Res.
|
| 2001 | J | jnl |
Transp. Sci.
|
| 2000 | J | jnl |
Oper. Res. Lett.
|
| 1999 | J | jnl |
Discret. Appl. Math.
|
| 1998 | J | jnl |
Oper. Res. Lett.
|
| 1998 | J | jnl |
Ann. Oper. Res.
|
| 1996 | J | jnl |
INFORMS J. Comput.
|
| 1994 | J | jnl |
SIAM J. Discret. Math.
|
| 1994 | J | jnl |
Discret. Appl. Math.
|
| 1993 | J | jnl |
Discret. Appl. Math.
|
| 1992 | J | jnl |
Oper. Res.
|