Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model
From MaRDI portal
Publication:2940542
DOI10.1287/ijoc.2013.0584zbMath1304.90148OpenAlexW2152711966MaRDI QIDQ2940542
Publication date: 27 January 2015
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2013.0584
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A note on node packing polytopes on hypergraphs
- Analysis of the consistency of a mixed integer programming-based multi-category constrained discriminant model
- A generalization of antiwebs to independence systems and their canonical facets
- Comparability graphs and intersection graphs
- Constrained discriminant analysis via \(0/1\) mixed integer programming
- Facets of the independent set polytope
- Hybrid misclassification minimization
- Conflict graphs in solving integer programming problems
- Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut
- A Linear Programming Approach to Discriminant Analysis with a Reserved-Judgment Region
- Support Vector Machines with the Ramp Loss and the Hard Margin Loss
- 10.1162/15324430260185628
- Statistical Analysis of Financial Data in S-Plus
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs
- Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra
- Multivariate classification trees based on minimum features discrete support vector machines
- Properties of vertex packing and independence system polyhedra
- Transitive Packing: A Unifying Concept in Combinatorial Optimization
- On the facial structure of set packing polyhedra
This page was built for publication: Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model
