| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2022 | J | jnl |
Math. Program. Comput.
|
| 2022 | J | jnl |
Discret. Appl. Math.
|
| 2021 | J | jnl |
ACM J. Exp. Algorithmics
|
| 2019 | J | jnl |
CoRR
|
| 2019 | — | conf |
INSCI
|
| 2018 | C | ed. |
ISCO
|
| 2015 | J | jnl |
Math. Program.
|
| 2014 | J | jnl |
Math. Program.
|
| 2013 | J | jnl |
Int. Trans. Oper. Res.
|
| 2012 | J | jnl |
Math. Program.
|
| 2010 | — | book |
|
| 2010 | J | jnl |
Math. Program.
|
| 2010 | J | jnl |
Math. Program.
|
| 2009 | — | conf |
eHealth
|
| 2009 | J | jnl |
J. Satisf. Boolean Model. Comput.
|
| 2008 | — | conf |
BIOCOMP
|
| 2008 | B | ed. |
IPCO
|
| 2008 | C | conf |
ICCHP
|
| 2007 | B | conf |
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations.
IPCO
|
| 2007 | J | jnl |
SIAM J. Optim.
|
| 2007 | J | jnl |
Math. Oper. Res.
|
| 2005 | J | jnl |
J. Soc. Struct.
|
| 2005 | J | jnl |
Math. Program.
|
| 2004 | — | ch. |
The Sharpest Cut
|
| 2004 | J | jnl |
Discret. Math.
|
| 2004 | B | conf |
IPCO
|
| 2003 | — | ed. |
Combinatorial Optimization
|
| 2003 | J | jnl |
Math. Program.
|
| 2003 | J | jnl |
Oper. Res. Lett.
|
| 2003 | J | jnl |
Math. Program.
|
| 2002 | A* | conf |
SODA
|
| 2002 | A | conf |
ESA
|
| 2002 | — | ch. |
The Vehicle Routing Problem
|
| 2002 | J | jnl |
Math. Program.
|
| 2002 | A* | conf |
SODA
|
| 2001 | — | conf |
Computational Combinatorial Optimization
|
| 2000 | J | jnl |
Algorithmica
|
| 1997 | J | jnl |
Math. Program.
|
| 1997 | — | conf |
WAE
|
| 1996 | A | conf |
CADE
|
| 1996 | J | jnl |
SIAM J. Discret. Math.
|
| 1995 | J | jnl |
Discret. Appl. Math.
|
| 1993 | B | ed. |
IPCO
|
| 1993 | J | jnl |
Math. Program.
|
| 1992 | J | jnl |
Math. Oper. Res.
|
| 1991 | J | jnl |
SIAM Rev.
|
| 1991 | J | jnl |
Math. Program.
|
| 1990 | J | jnl |
Math. Program.
|
| 1990 | J | jnl |
Math. Program.
|
| 1990 | B | conf |
IPCO
|
| 1986 | J | jnl |
Algorithmica
|