| 2013 | ||
|---|---|---|
| j5 | Francesco Carrabs, Raffaele Cerulli, Maria Grazia Speranza: A branch-and-bound algorithm for the double travelling salesman problem with two stacks. Networks 61(1): 58-75 (2013) | |
| 2011 | ||
| c3 | Paolo Dell'Olmo, Raffaele Cerulli, Francesco Carrabs: The maximum labeled clique problem. CTW 2011: 146-149 | |
| c2 | Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato: A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem. INOC 2011: 589-602 | |
| 2009 | ||
| j4 | Francesco Carrabs, Raffaele Cerulli, Monica Gentili: The labeled maximum matching problem. Computers & OR 36(6): 1859-1871 (2009) | |
| 2007 | ||
| j3 | Francesco Carrabs, Jean-François Cordeau, Gilbert Laporte: Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading. INFORMS Journal on Computing 19(4): 618-632 (2007) | |
| 2005 | ||
| j2 | Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato: A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds. Inf. Process. Lett. 94(1): 29-35 (2005) | |
| 2004 | ||
| j1 | Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato: Minimum Weighted Feedback Vertex Set on Diamonds. Electronic Notes in Discrete Mathematics 17: 87-91 (2004) | |
| c1 | Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato: Minimum Weighted Feedback Vertex Set on Diamonds. CTW 2004: 81-85 | |
| 1 | Raffaele Cerulli | |
| 2 | Jean-François Cordeau | |
| 3 | Paolo Dell'Olmo | |
| 4 | Monica Gentili | |
| 5 | Gilbert Laporte | |
| 6 | Gennaro Parlato | |
| 7 | Maria Grazia Speranza |
Data released under the ODC-BY 1.0 license — See also our legal information page