Experiments concerning sequential versus simultaneous maximization of objective function and distance Export

@article{citeulike:3108937, abstract = {Abstract\ \  Suppose two solution vectors are needed that have good objective function values and are different from each other. The following question has not yet been systematically researched: Should the two vectors be generated sequentially or simultaneously? We provide evidence that for broad ranges of practically achievable distances, sequential generation usually requires less computational effort and produces solutions that are at least as good as produced by simultaneous generation. This is done using experiments based on publicly available instances of the multi-constrained, zero-one knapsack problem, which are corroborated using experiments conducted with the linear assignment problem.}, author = {Greistorfer, Peter and L{\o}kketangen, Arne and Vo{\ss}, Stefan and Woodruff, David}, citeulike-article-id = {3108937}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/s10732-007-9053-z}, citeulike-linkout-1 = {http://www.springerlink.com/content/44ntt315h4080k25}, day = {1}, doi = {10.1007/s10732-007-9053-z}, journal = {Journal of Heuristics}, keywords = {diversity, integer, linear, programming}, month = {December}, number = {6}, pages = {613--625}, posted-at = {2009-11-08 10:36:47}, priority = {2}, title = {Experiments concerning sequential versus simultaneous maximization of objective function and distance}, url = {http://dx.doi.org/10.1007/s10732-007-9053-z}, volume = {14}, year = {2008} }

TY - JOUR ID - citeulike:3108937 L3 - citeulike-article-id:3108937 N2 - Abstract   Suppose two solution vectors are needed that have good objective function values and are different from each other. The following question has not yet been systematically researched: Should the two vectors be generated sequentially or simultaneously? We provide evidence that for broad ranges of practically achievable distances, sequential generation usually requires less computational effort and produces solutions that are at least as good as produced by simultaneous generation. This is done using experiments based on publicly available instances of the multi-constrained, zero-one knapsack problem, which are corroborated using experiments conducted with the linear assignment problem. IS - 6 JF - Journal of Heuristics EP - 625 TI - Experiments concerning sequential versus simultaneous maximization of objective function and distance VL - 14 SP - 613 KW - diversity KW - integer KW - linear KW - programming AU - Greistorfer, Peter AU - Løkketangen, Arne AU - Voß, Stefan AU - Woodruff, David PY - 2008/12/01/ UR - http://dx.doi.org/10.1007/s10732-007-9053-z ER -