The geodesic classification problem on graphs

DOI10.1016/j.entcs.2019.08.007OpenAlexW2979029977WikidataQ113317426 ScholiaQ113317426MaRDI QIDQ2132333

Paulo Henrique Macêdo de Araújo, Martine Labbé, Ricardo C. Corrêa, Manoel B. Campêlo

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.007

zbMATH Keywords

classificationinteger linear programminggeodesic convexity

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Related Items (2)

Maximal closed set and half-space separations in finite closure systems ⋮ Bounds and algorithms for geodetic hulls

Uses Software

• CRIO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Supervised classification and mathematical optimization
• Convex graph covers
• Support-vector networks
• Partitioning a graph into convex sets
• On the combinatorics of the 2-class classification problem
• A mixed-integer programming approach to multi-class data classification problem
• Geodesic Convexity in Graphs
• A MIXED INTEGER PROGRAMMING MODEL FOR MULTIPLE-CLASS DISCRIMINANT ANALYSIS
• Classification and Regression via Integer Optimization

This page was built for publication: The geodesic classification problem on graphs