 | 2011 |
| 12 |  | Marco A. Boschetti,
Vittorio Maniezzo,
Matteo Roffilli:
A Fully Distributed Lagrangean Solution for a Peer-to-Peer Overlay Network Design Problem.
INFORMS Journal on Computing 23(1): 90-104 (2011) |
| 2010 |
| 11 |  | Antonio Bolufé Röhler,
Marco A. Boschetti,
Vittorio Maniezzo:
Soft Variable Fixing in Path Relinking: An Application to ACO Codes.
ANTS Conference 2010: 576-577 |
| 10 |  | Marco A. Boschetti,
Vittorio Maniezzo,
Matteo Roffilli:
Decomposition Techniques as Metaheuristic Frameworks.
Matheuristics 2010: 135-158 |
| 2009 |
| 9 |  | Marco A. Boschetti,
Vittorio Maniezzo,
Matteo Roffilli,
Antonio Bolufé Röhler:
Matheuristics: Optimization, Simulation and Control.
Hybrid Metaheuristics 2009: 171-177 |
| 8 |  | Marco A. Boschetti,
Vittorio Maniezzo:
Benders decomposition, Lagrangean relaxation and metaheuristic design.
J. Heuristics 15(3): 283-312 (2009) |
| 2008 |
| 7 |  | Marco A. Boschetti,
Aristide Mingozzi,
Salvatore Ricciardelli:
A dual ascent procedure for the set partitioning problem.
Discrete Optimization 5(4): 735-747 (2008) |
| 2007 |
| 6 |  | Roberto Baldacci,
Marco A. Boschetti:
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem.
European Journal of Operational Research 183(3): 1136-1149 (2007) |
| 2004 |
| 5 |  | Vittorio Maniezzo,
Marco A. Boschetti,
Márk Jelasity:
An Ant Approach to Membership Overlay Design.
ANTS Workshop 2004: 37-48 |
| 4 |  | Marco A. Boschetti,
Aristide Mingozzi,
Salvatore Ricciardelli:
An Exact Algorithm for the Simplified Multiple Depot Crew Scheduling Problem.
Annals OR 127(1-4): 177-201 (2004) |
| 3 |  | Marco A. Boschetti:
New lower bounds for the three-dimensional finite bin packing problem.
Discrete Applied Mathematics 140(1-3): 241-258 (2004) |
| 2003 |
| 2 |  | Marco A. Boschetti,
Aristide Mingozzi:
The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case.
4OR 1(1): 27-42 (2003) |
| 1 |  | Marco A. Boschetti,
Aristide Mingozzi:
The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds.
4OR 1(2): 135-147 (2003) |