Integer Programming Models and Polyhedral Study for the Geodesic Classification Problem on Graphs - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Integer Programming Models and Polyhedral Study for the Geodesic Classification Problem on Graphs

(1) , (1) , (2) ,
1
2

Abstract

We study a discrete version of the classical classification problem in the Euclidean space, to be called geodesic classification problem. It is defined on a graph, where some vertices are initially assigned a class and the remaining ones must be classified. This vertex partition into classes is grounded on the concept of geodesic convexity on graphs, as a replacement for the Euclidean convexity in the multidimensional space. We propose two new integer programming models along with branch-and-cut algorithms to solve them. We also carry out a polyhedral study of the associated polyhedra, which includes families of facet-defining inequalities and separation algorithms. Finally, we run computational experiments to evaluate the computational efficiency and the classification accuracy of the proposed approaches by comparing them with classic solution methods for the Euclidean convexity classification problem.
Fichier principal
Vignette du fichier
Geodesic classification.pdf (611.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03727579 , version 1 (19-07-2022)

Identifiers

  • HAL Id : hal-03727579 , version 1

Cite

Paulo H M Araújo, Manoel Campêlo, Ricardo C Corrêa, Martine Labbé. Integer Programming Models and Polyhedral Study for the Geodesic Classification Problem on Graphs. 2022. ⟨hal-03727579⟩

Collections

CNRS
15 View
6 Download

Share

Gmail Facebook Twitter LinkedIn More