We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the ...
Inference in constraint programming is usually based on the deductions generated by individual constraints which are then communicated to other constraints through domain filteri...
Tarik Hadzic, Eoin O'Mahony, Barry O'Sullivan, Mei...
Abstract— This paper presents a comparison of four bioinspired algorithms (all seen as search engines) with a similar constraint-handling mechanism (Deb’s feasibility rules) to...
— Addressing dynamic optimization problems has attracted a growing interest from the evolutionary algorithm community in recent years due to its importance in the applications of...
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...