Large-scale k-means clustering with user-centric privacy-preservation

By Sakuma Jun   Kobayashi Shigenobu  

Knowledge and Information Systems, Vol. 25, Iss. 2, 2010-11 ,pp. : 253-279

Springer Publishing Company

Access to resources Recommend Favorite

Variable and large neighborhood search to solve the multiobjective set covering problem

By Lust T.   Tuyttens D.  

Journal of Heuristics, Vol. 20, Iss. 2, 2014-04 ,pp. : 165-188

Springer Publishing Company

Access to resources Recommend Favorite

A discrete artificial bee colony for multiple Knapsack problem

By Sabet Shima   Shokouhifar Mohammad   Farokhi Fardad  

International Journal of Reasoning-based Intelligent Systems, Vol. 5, Iss. 2, 2013-10 ,pp. : 88-95

Inderscience Publishers

Access to resources Recommend Favorite

A constraint programming-based approach to a large-scale energy management problem with varied constraints: A solution approach to the ROADEF/EURO Challenge 2010

By Brandt Felix   Bauer Reinhard   Völker Markus   Cardeneo Andreas  

Journal of Scheduling, Vol. 16, Iss. 6, 2013-12 ,pp. : 629-648

Springer Publishing Company

Access to resources Recommend Favorite

LP based heuristics for the multiple knapsack problem with assignment restrictions

By Dahl Geir  

Annals of Operations Research, Vol. 146, Iss. 1, 2006-09 ,pp. : 91-104

Springer Publishing Company

Access to resources Recommend Favorite