Application-specific, parameterized local search algorithms (PLSAs), in which optimization accuracy can be traded off with runtime, arise naturally in many optimization contexts....
We derive optimal bidding strategies for a global bidder who participates in multiple, simultaneous second-price auctions with perfect substitutes. We first consider a model where...
Enrico Gerding, Rajdeep K. Dash, David C. K. Yuen,...
— We propose an expectation-maximization (EM) technique for locating multiple transmitters based on power levels observed by a set of arbitrarily-placed receivers. Multiple trans...
Abstract- The Pareto optimal solutions to a multiobjective optimization problem often distribute very regularly in both the decision space and the objective space. Most existing ev...
Aimin Zhou, Qingfu Zhang, Yaochu Jin, Edward P. K....
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
Raffaele Cipriano, Luca Di Gaspero, Agostino Dovie...