Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
Dale Schuurmans, Finnegan Southey, Robert C. Holte
Abstract. We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most...
In this paper, we show how an efficient ant based algorithm, called API and initially designed to perform real parameter optimization, can be adapted to the difficult problem of Hi...