André Rossi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
André Rossi has a total of 77 co-authors. Here are the top co-authors by number of shared publications:
- Marc Sevaux
Université Bretagne Sud, Lab-STICC, UMR 6285, CNRS, Lorient, France
26 shared publications - Alok Singh
University of Hyderabad
11 shared publications Alok Singh
8 shared publicationsMaría Soto
7 shared publications- Alexis Aubry
Université de Lorraine, CNRS, CRAN
6 shared publications - Fabián Castaño
Universidad de los Andes
6 shared publications
Latest Publications
- 17 August 2026
- Published by Elsevier in European Journal of Operational Research
Exact clique number manipulation via edge interdiction
- 17 August 2026
- Published by Elsevier in European Journal of Operational Research
Exact clique number manipulation via edge interdiction
- Open Access
- 3 April 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 335 (3) , 839-854
Stability factor for robust balancing of transfer lines under task processing time uncertainty
- 3 April 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 335 (3) , 839-854
Open AccessStability factor for robust balancing of transfer lines under task processing time uncertainty
- Open Access
Exact Clique Number Manipulation via Edge Interdiction
The Edge Interdiction Clique Problem (EICP) aims to remove at most $k$ edges from a graph so as to minimize the size of the largest clique in the remaining graph. This problem captures a fundamental question in graph manipulation: which edges are structurally critical for preserving large cliques? Such a problem is also motivated by practical applications including protein function maintenance and image matching. The EICP is computationally challenging and belongs to a complexity class beyond NP. Existing approaches rely on general mixed-integer bilevel programming solvers or reformulate the problem into a single-level mixed integer linear program. However, they are still not scalable when the graph size and interdiction budget $k$ grow. To overcome this, we investigate new mixed integer linear formulations, which recast the problem into a sequence of parameterized Edge Blocker Clique Problems (EBCP). This perspective decomposes the original problem into simpler subproblems and enables tighter modeling of clique-related inequalities. Furthermore, we propose a two-stage exact algorithm, \textsc{RLCM}, which first applies problem-specific reduction techniques to shrink the graph and then solves the reduced problem using a tailored branch-and-cut framework. Extensive computational experiments on maximum clique benchmark graphs, large real-world sparse networks, and random graphs demonstrate that \textsc{RLCM} consistently outperforms existing approaches.Open AccessExact Clique Number Manipulation via Edge Interdiction
The Edge Interdiction Clique Problem (EICP) aims to remove at most $k$ edges from a graph so as to minimize the size of the largest clique in the remaining graph. This problem captures a fundamental question in graph manipulation: which edges are structurally critical for preserving large cliques? Such a problem is also motivated by practical applications including protein function maintenance and image matching. The EICP is computationally challenging and belongs to a complexity class beyond NP. Existing approaches rely on general mixed-integer bilevel programming solvers or reformulate the problem into a single-level mixed integer linear program. However, they are still not scalable when the graph size and interdiction budget $k$ grow. To overcome this, we investigate new mixed integer linear formulations, which recast the problem into a sequence of parameterized Edge Blocker Clique Problems (EBCP). This perspective decomposes the original problem into simpler subproblems and enables tighter modeling of clique-related inequalities. Furthermore, we propose a two-stage exact algorithm, \textsc{RLCM}, which first applies problem-specific reduction techniques to shrink the graph and then solves the reduced problem using a tailored branch-and-cut framework. Extensive computational experiments on maximum clique benchmark graphs, large real-world sparse networks, and random graphs demonstrate that \textsc{RLCM} consistently outperforms existing approaches. - 7 August 2025
- Published by Elsevier in Computers & Operations Research
Survivable two-fault-tolerant ring star problem
- 7 August 2025
- Published by Elsevier in Computers & Operations Research
Survivable two-fault-tolerant ring star problem
- 26 March 2025
- Published by Springer Nature in Annals of Operations Research
- Vol. 349 (3) , 1891-1931
Minimum-cardinality global defensive alliances in general graphs
- 26 March 2025
- Published by Springer Nature in Annals of Operations Research
- Vol. 349 (3) , 1891-1931
Minimum-cardinality global defensive alliances in general graphs
- Open Access
Resilient and Survivable Ring Star Problems
In this paper, we consider both the Resilient Ring Star Problem, in which a solution should be easy to fix when a single hub fails, and the Survivable Ring Star Problem, in which a solution guarantees that a Ring Star topology is available at no cost when a single hub fails. An ILP formulation is proposed for both problems, as well as a Benders decomposition. The solution provided by both problems are also compared in order to determine which problem returns the most appropriate solutions, when the failure rate varies.
Open AccessResilient and Survivable Ring Star Problems
In this paper, we consider both the Resilient Ring Star Problem, in which a solution should be easy to fix when a single hub fails, and the Survivable Ring Star Problem, in which a solution guarantees that a Ring Star topology is available at no cost when a single hub fails. An ILP formulation is proposed for both problems, as well as a Benders decomposition. The solution provided by both problems are also compared in order to determine which problem returns the most appropriate solutions, when the failure rate varies.
A survivable variant of the ring star problem
The Ring Star Problem consists in selecting a subset of nodes called hubs including the depot and linking them with a cycle, the remaining nodes being connected to exactly one hub, at minimum cost. We study a survivable variant of the Ring Star Problem where at most one node in a given subset of so‐called uncertain nodes can fail if selected as a hub. We model this problem as an Integer Linear Program (ILP), that is also addressed with a Branch‐and‐Benders‐cut decomposition. The Benders subproblem is turned into a linear program with the addition of new inequalities that are shown to be facet‐defining, and several enhancements to both the ILP and Branch‐and‐Benders‐cut algorithm are also presented. Both approaches are compared on the basis of extensive numerical experiments that bring the following conclusions. First, the survivable variant is shown to be much harder than the original Ring Star Problem, and the extra cost induced by survivability is significant. Second, the ILP formulation tends to produce tighter lower bounds but memory issues are frequent for large instances. Finally, the Branch‐and‐Benders‐cut algorithm returns feasible solutions that are often of better quality than those produced by ILP, and is less frequently subjected to memory issues on the considered set of instances.
A survivable variant of the ring star problem
The Ring Star Problem consists in selecting a subset of nodes called hubs including the depot and linking them with a cycle, the remaining nodes being connected to exactly one hub, at minimum cost. We study a survivable variant of the Ring Star Problem where at most one node in a given subset of so‐called uncertain nodes can fail if selected as a hub. We model this problem as an Integer Linear Program (ILP), that is also addressed with a Branch‐and‐Benders‐cut decomposition. The Benders subproblem is turned into a linear program with the addition of new inequalities that are shown to be facet‐defining, and several enhancements to both the ILP and Branch‐and‐Benders‐cut algorithm are also presented. Both approaches are compared on the basis of extensive numerical experiments that bring the following conclusions. First, the survivable variant is shown to be much harder than the original Ring Star Problem, and the extra cost induced by survivability is significant. Second, the ILP formulation tends to produce tighter lower bounds but memory issues are frequent for large instances. Finally, the Branch‐and‐Benders‐cut algorithm returns feasible solutions that are often of better quality than those produced by ILP, and is less frequently subjected to memory issues on the considered set of instances.
- 26 August 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 313 (3) , 1015-1030
A new upper bound based on Dantzig-Wolfe decomposition to maximize the stability radius of a simple assembly line under uncertainty
- 26 August 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 313 (3) , 1015-1030
A new upper bound based on Dantzig-Wolfe decomposition to maximize the stability radius of a simple assembly line under uncertainty
- 2 June 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 230
An online method for robust target tracking using a wireless sensor network
- 2 June 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 230
An online method for robust target tracking using a wireless sensor network
- 1 September 2021
- Published by Elsevier in Applied Soft Computing
- Vol. 108
Multi-start iterated local search, exact and matheuristic approaches for minimum capacitated dominating set problem
- 1 September 2021
- Published by Elsevier in Applied Soft Computing
- Vol. 108
Multi-start iterated local search, exact and matheuristic approaches for minimum capacitated dominating set problem