Results 281 to 290 of about 244,573 (375)

Integer Linear Programming Model for Profit Maximization using Branch and Bound Algorithm in Retail Companies: Case of a Peruvian Company

open access: diamond
John Diego Chancahuana Castillo   +3 more
openalex   +1 more source

A Branch and Bound Algorithm for Feature Subset Selection

IEEE Transactions on Computers, 1977
A feature subset selection algorithm based on branch and bound techniques is developed to select the best subset of m features from an n-feature set. Existing procedures for feature subset selection, such as sequential selection and dynamic programming, do not guarantee optimality of the selected feature subset. Exhaustive search, on the other hand, is
Narendra, Patrenahalli M.   +1 more
semanticscholar   +4 more sources

Home - About - Disclaimer - Privacy