Reducing complexity in winner determination for combinatorial ascending auctions

By Ono C.   Nishiyama S.   Horiuchi H.  

Electronic Commerce Research and Applications, Vol. 2, Iss. 2, 2003-06 ,pp. : 176-186

Elsevier

Access to resources Recommend Favorite

Solving the flight perturbation problem with meta heuristics

By Andersson Tobias  

Journal of Heuristics, Vol. 12, Iss. 1-2, 2006-03 ,pp. : 37-53

Springer Publishing Company

Access to resources Recommend Favorite

Combinatorial auctions

By Abrache Jawad  

Annals of Operations Research, Vol. 153, Iss. 1, 2007-09 ,pp. : 131-164

Springer Publishing Company

Access to resources Recommend Favorite

A memetic algorithm for the optimal winner determination problem

By Boughaci Dalila  

Soft Computing, Vol. 13, Iss. 8-9, 2009-07 ,pp. : 905-917

Springer Publishing Company

Access to resources Recommend Favorite

Sequential and Parallel Meta-Heuristics for Solving the Single Row Routing Problem

By Zomaya Albert Y.   Patterson Daniel   Olariu Stephan  

Cluster Computing, Vol. 7, Iss. 2, 2004-04 ,pp. : 123-139

Springer Publishing Company

Access to resources Recommend Favorite