Franc Marchetti

According to our database, Franc Marchetti authored at least 5 papers between 2014 and 2024.

Collaborative distances:

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

2024

A branch-and-cut algorithm for the connected max-k-cut problem.

Patrick Healy, Nicolas Jozefowiez, Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka

Eur. J. Oper. Res., January, 2024

2020

Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut.

Pierre Laroche, Franc Marchetti, Sébastien Martin, Anass Nagih, Zsuzsanna Róka

Discret. Optim., 2020

Exact and Heuristic Solutions to the Connected k-Partitioning Problem.

Patrick Healy, Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka

Proceedings of the 7th International Conference on Control, 2020

2017

Bipartite complete matching vertex interdiction problem with incompatibility constraints: Complexity and heuristics.

Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka

Proceedings of the 4th International Conference on Control, 2017

2014

Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment.

Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka

Proceedings of the International Conference on Control, 2014