Integer programming models and polyhedral study for the geodesic classification problem on graphs
From MaRDI portal
Publication:6556086
Cites work
- An integer programming approach for the 2-class single-group classification problem
- Classification and Regression via Integer Optimization
- Convex graph covers
- Convex recoloring of paths
- Facets of the clique partitioning polytope
- Formulations and valid inequalities of the node capacitated graph partitioning problem
- Geodesic Convexity in Graphs
- Graph theory
- scientific article; zbMATH DE number 5277890 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 6403512 (Why is no real title available?)
- Minimizing the error of linear separators on linearly inseparable data
- On the asymmetric representatives formulation for the vertex coloring problem
- 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\}\)
- Partitioning a graph into convex sets
- Reducibility among combinatorial problems
- Support-vector networks
- The geodesic classification problem on graphs
- The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut
- The partition problem
- The vertex separator problem: a polyhedral investigation
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)
