Integer programming models and polyhedral study for the geodesic classification problem on graphs

DOI10.1016/j.ejor.2023.08.029MaRDI QIDQ6556086

Ricardo Corrêa, Manoel Campêlo, Paulo H. M. Araújo, Martine Labbé

Publication date: 17 June 2024

Published in: (Search for Journal in Brave)

zbMATH Keywords

classificationinteger programmingcombinatorial optimizationpolyhedral combinatoricsgeodesic convexity

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimizing the error of linear separators on linearly inseparable data
• Facets of the clique partitioning polytope
• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• On the set covering polytope: Facets with coefficients in \(\{0,1,2,3\}\)
• Convex graph covers
• The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut
• Formulations and valid inequalities of the node capacitated graph partitioning problem
• Support-vector networks
• The geodesic classification problem on graphs
• An integer programming approach for the 2-class single-group classification problem
• Partitioning a graph into convex sets
• The partition problem
• Convex recoloring of paths
• On the asymmetric representatives formulation for the vertex coloring problem
• The vertex separator problem: a polyhedral investigation
• Geodesic Convexity in Graphs
• Classification and Regression via Integer Optimization
• Reducibility among Combinatorial Problems

This page was built for publication: Integer programming models and polyhedral study for the geodesic classification problem on graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6556086)