callback( { "result":{ "query":":facetid:toc:\"db/journals/dam/dam133.bht\"", "status":{ "@code":"200", "text":"OK" }, "time":{ "@unit":"msecs", "text":"179.39" }, "completions":{ "@total":"1", "@computed":"1", "@sent":"1", "c":{ "@sc":"7", "@dc":"7", "@oc":"7", "@id":"43445901", "text":":facetid:toc:db/journals/dam/dam133.bht" } }, "hits":{ "@total":"7", "@computed":"7", "@sent":"7", "@first":"0", "hit":[{ "@score":"1", "@id":"6111271", "info":{"authors":{"author":[{"@pid":"86/4956","text":"Paola Cappanera"},{"@pid":"01/5473","text":"Giorgio Gallo"},{"@pid":"79/3455","text":"Francesco Maffioli"}]},"title":"Discrete facility location and routing of obnoxious activities.","venue":"Discret. Appl. Math.","volume":"133","number":"1-3","pages":"3-28","year":"2003","type":"Journal Articles","access":"open","key":"journals/dam/CappaneraGM03","doi":"10.1016/S0166-218X(03)00431-1","ee":"https://doi.org/10.1016/S0166-218X(03)00431-1","url":"https://dblp.org/rec/journals/dam/CappaneraGM03"}, "url":"URL#6111271" }, { "@score":"1", "@id":"6111283", "info":{"authors":{"author":[{"@pid":"65/4121","text":"Giuseppe Confessore"},{"@pid":"75/5423","text":"Paolo Dell'Olmo"},{"@pid":"25/5858","text":"Stefano Giordani"}]},"title":"Complexity and approximation results for scheduling multiprocessor tasks on a ring.","venue":"Discret. Appl. Math.","volume":"133","number":"1-3","pages":"29-44","year":"2003","type":"Journal Articles","access":"open","key":"journals/dam/ConfessoreDG03","doi":"10.1016/S0166-218X(03)00432-3","ee":"https://doi.org/10.1016/S0166-218X(03)00432-3","url":"https://dblp.org/rec/journals/dam/ConfessoreDG03"}, "url":"URL#6111283" }, { "@score":"1", "@id":"6111306", "info":{"authors":{"author":[{"@pid":"26/6725","text":"Richard W. Eglese"},{"@pid":"31/6858","text":"Martin G. Everett"},{"@pid":"22/2125","text":"Chris N. Potts"},{"@pid":"63/418","text":"Vitaly A. Strusevich"}]},"title":"Preface: International Symposium on Combinatorial Optimisation.","venue":"Discret. Appl. Math.","volume":"133","number":"1-3","pages":"1-2","year":"2003","type":"Journal Articles","access":"open","key":"journals/dam/EgleseEPS03","doi":"10.1016/S0166-218X(03)00430-X","ee":"https://doi.org/10.1016/S0166-218X(03)00430-X","url":"https://dblp.org/rec/journals/dam/EgleseEPS03"}, "url":"URL#6111306" }, { "@score":"1", "@id":"6111359", "info":{"authors":{"author":[{"@pid":"v/StanPMvanHoesel","text":"Stan P. M. van Hoesel"},{"@pid":"37/1581","text":"Arie M. C. A. Koster"},{"@pid":"93/1146","text":"Robert L. M. J. van de Leensel"},{"@pid":"82/437","text":"Martin W. P. Savelsbergh"}]},"title":"Bidirected and unidirected capacity installation in telecommunication networks.","venue":"Discret. Appl. Math.","volume":"133","number":"1-3","pages":"103-121","year":"2003","type":"Journal Articles","access":"open","key":"journals/dam/HoeselKLS03","doi":"10.1016/S0166-218X(03)00436-0","ee":"https://doi.org/10.1016/S0166-218X(03)00436-0","url":"https://dblp.org/rec/journals/dam/HoeselKLS03"}, "url":"URL#6111359" }, { "@score":"1", "@id":"6111372", "info":{"authors":{"author":[{"@pid":"98/5494","text":"Hans Kellerer"},{"@pid":"63/418","text":"Vitaly A. Strusevich"}]},"title":"Scheduling problems for parallel dedicated machines under multiple resource constraints.","venue":"Discret. Appl. Math.","volume":"133","number":"1-3","pages":"45-68","year":"2003","type":"Journal Articles","access":"open","key":"journals/dam/KellererS03","doi":"10.1016/S0166-218X(03)00433-5","ee":"https://doi.org/10.1016/S0166-218X(03)00433-5","url":"https://dblp.org/rec/journals/dam/KellererS03"}, "url":"URL#6111372" }, { "@score":"1", "@id":"6111431", "info":{"authors":{"author":[{"@pid":"14/3113","text":"R. J. Petch"},{"@pid":"87/630","text":"Saïd Salhi"}]},"title":"A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.","venue":"Discret. Appl. Math.","volume":"133","number":"1-3","pages":"69-92","year":"2003","type":"Journal Articles","access":"open","key":"journals/dam/PetchS03","doi":"10.1016/S0166-218X(03)00434-7","ee":"https://doi.org/10.1016/S0166-218X(03)00434-7","url":"https://dblp.org/rec/journals/dam/PetchS03"}, "url":"URL#6111431" }, { "@score":"1", "@id":"6111450", "info":{"authors":{"author":{"@pid":"162/8747","text":"V. V. Shenmaier"}},"title":"A greedy algorithm for some classes of integer programs.","venue":"Discret. Appl. Math.","volume":"133","number":"1-3","pages":"93-101","year":"2003","type":"Journal Articles","access":"open","key":"journals/dam/Shenmaier03","doi":"10.1016/S0166-218X(03)00435-9","ee":"https://doi.org/10.1016/S0166-218X(03)00435-9","url":"https://dblp.org/rec/journals/dam/Shenmaier03"}, "url":"URL#6111450" } ] } } } )