Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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

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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal-cnrs.archives-ouvertes.fr/hal-03727579
Contributor : Martine Labbé Connect in order to contact the contributor
Submitted on : Tuesday, July 19, 2022 - 1:42:51 PM
Last modification on : Thursday, July 21, 2022 - 10:06:29 AM

File

Geodesic classification.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03727579, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

0

Files downloads

0