Sciweavers

440 search results - page 21 / 88
» Local Search Heuristics for the Multidimensional Assignment ...
Sort
View
CEC
2009
IEEE
14 years 11 days ago
Memetic algorithm with Local search chaining for large scale continuous optimization problems
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
Daniel Molina, Manuel Lozano, Francisco Herrera
WINE
2005
Springer
139views Economy» more  WINE 2005»
14 years 1 months ago
Price of Anarchy, Locality Gap, and a Network Service Provider Game
In this paper, we define a network service provider game. We show that the price of anarchy of the defined game can be bounded by analyzing a local search heuristic for a related...
Nikhil R. Devanur, Naveen Garg, Rohit Khandekar, V...
AUSAI
2005
Springer
14 years 1 months ago
A Lagrangian Heuristic for Winner Determination Problem in Combinatorial Auctions
Abstract. We present a Lagrangian-based heuristic LAHA for the Winner Determination Problem in Combinatorial Auctions. The algorithm makes use of the market computing power by appl...
Andrew Lim, Jiqing Tang
4OR
2008
79views more  4OR 2008»
13 years 7 months ago
MIP-based heuristic for non-standard 3D-packing problems
This paper is the continuation of a previous work (Fasano 2004), dedicated to a MIP formulation for non-standard three-dimensional packing issues, with additional conditions. The ...
Giorgio Fasano
EOR
2010
107views more  EOR 2010»
13 years 7 months ago
An optimization-based heuristic for the robotic cell problem
This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transpo...
Jacques Carlier, Mohamed Haouari, Mohamed Kharbech...