Fabio Parisini

According to our database, Fabio Parisini authored at least 8 papers between 2007 and 2012.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2012

Bounding, filtering and diversification in CP-based local branching.

Zeynep Kiziltan, Andrea Lodi, Michela Milano, Fabio Parisini

J. Heuristics, 2012

Sliced Neighborhood Search.

Fabio Parisini, Michela Milano

Expert Syst. Appl., 2012

2011

Hybrid constraint programming and metaheuristic methods for large scale optimization problems.

Fabio Parisini

PhD thesis, 2011

Improving CP-based local branching via sliced neighborhood search.

Fabio Parisini, Michela Milano

Proceedings of the 2011 ACM Symposium on Applied Computing (SAC), TaiChung, Taiwan, March 21, 2011

2010

Local Branching in a Constraint Programming Framework.

Fabio Parisini

Proceedings of the Technical Communications of the 26th International Conference on Logic Programming, 2010

Discrepancy-Based Sliced Neighborhood Search.

Fabio Parisini, Michele Lombardi, Michela Milano

Proceedings of the Artificial Intelligence: Methodology, 2010

2008

Bi-dimensional Domains for the Non-overlapping Rectangles Constraint.

Fabio Parisini

Proceedings of the Logic Programming, 24th International Conference, 2008

2007

CP-Based Local Branching.

Zeynep Kiziltan, Andrea Lodi, Michela Milano, Fabio Parisini

Proceedings of the Principles and Practice of Constraint Programming, 2007