Constraint elimination method for the committee problem

DOI10.1134/S0005117912020130zbMath1307.90150OpenAlexW2014087933MaRDI QIDQ2261721

K. S. Kobylkin

Publication date: 13 March 2015

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117912020130

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

Committee polyhedral separability: complexity and polynomial approximation ⋮ Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms

Cites Work

• On the computational complexity of the minimum committee problem
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constraint elimination method for the committee problem