A tabu search algorithm for the min-max k-chinese postman problem
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Dokumenttyp: | Article (Journal) |
| Sprache: | Englisch |
| Veröffentlicht: |
2006
|
| In: |
Computers & operations research
Year: 2006, Jahrgang: 33, Heft: 12, Pages: 3403-3422 |
| ISSN: | 0305-0548 |
| Online-Zugang: |
|
| Verfasserangaben: | Dino Ahr; Gerhard Reinelt |
MARC
| LEADER | 00000caa a22000002c 4500 | ||
|---|---|---|---|
| 001 | 1634620615 | ||
| 003 | DE-627 | ||
| 005 | 20220816003027.0 | ||
| 007 | tu | ||
| 008 | 120924s2006 xx ||||| 00| ||eng c | ||
| 035 | |a (DE-627)1634620615 | ||
| 035 | |a (DE-576)371552524 | ||
| 035 | |a (DE-599)BSZ371552524 | ||
| 035 | |a (OCoLC)1341158003 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 084 | |a 28 |2 sdnb | ||
| 100 | 1 | |a Ahr, Dino |0 (DE-588)1115277944 |0 (DE-627)869678620 |0 (DE-576)477724515 |4 aut | |
| 245 | 1 | 2 | |a A tabu search algorithm for the min-max k-chinese postman problem |c Dino Ahr; Gerhard Reinelt |
| 264 | 1 | |c 2006 | |
| 300 | |a 20 | ||
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 700 | 1 | |a Reinelt, Gerhard |0 (DE-588)101987113X |0 (DE-627)691042861 |0 (DE-576)358936187 |4 aut | |
| 773 | 0 | 8 | |i In |t Computers & operations research |d Oxford [u.a.] : Elsevier, 1974 |g 33(2006), 12, Seite 3403-3422 |w (DE-627)129436909 |w (DE-600)194012-0 |w (DE-576)014807637 |x 0305-0548 |7 nnas |a A tabu search algorithm for the min-max k-chinese postman problem |
| 773 | 1 | 8 | |g volume:33 |g year:2006 |g number:12 |g pages:3403-3422 |g extent:20 |a A tabu search algorithm for the min-max k-chinese postman problem |
| 951 | |a AR | ||
| 992 | |a 20120924 | ||
| 993 | |a Article | ||
| 994 | |a 2006 | ||
| 998 | |g 101987113X |a Reinelt, Gerhard |m 101987113X:Reinelt, Gerhard |d 110000 |d 110300 |e 110000PR101987113X |e 110300PR101987113X |k 0/110000/ |k 1/110000/110300/ |p 2 |y j | ||
| 999 | |a KXP-PPN1634620615 |e 328992548X | ||
| BIB | |a Y | ||
| SER | |a journal | ||
| JSO | |a {"type":{"bibl":"article-journal"},"physDesc":[{"extent":"20 S."}],"recId":"1634620615","relHost":[{"origin":[{"dateIssuedKey":"1974","publisher":"Elsevier ; Pergamon Press","dateIssuedDisp":"1974-","publisherPlace":"Oxford [u.a.] ; Oxford ; Braunschweig [u.a.]"}],"id":{"issn":["0305-0548"],"zdb":["194012-0"],"eki":["129436909"]},"title":[{"title_sort":"Computers & operations research","title":"Computers & operations research","subtitle":"and their applications to problems of world concern ; an international journal"}],"note":["Einzelne Hefte als \"Special issue\" bez","Repr.: Oxford : Pergamon Press"],"disp":"A tabu search algorithm for the min-max k-chinese postman problemComputers & operations research","type":{"bibl":"periodical"},"recId":"129436909","language":["eng"],"pubHistory":["1.1974 - 40.2013; Vol. 41.2014 -"],"part":{"volume":"33","text":"33(2006), 12, Seite 3403-3422","extent":"20","year":"2006","issue":"12","pages":"3403-3422"},"titleAlt":[{"title":"Computers and operations research"}]}],"language":["eng"],"name":{"displayForm":["Dino Ahr; Gerhard Reinelt"]},"person":[{"given":"Dino","family":"Ahr","role":"aut","display":"Ahr, Dino"},{"display":"Reinelt, Gerhard","role":"aut","family":"Reinelt","given":"Gerhard"}],"title":[{"title_sort":"tabu search algorithm for the min-max k-chinese postman problem","title":"A tabu search algorithm for the min-max k-chinese postman problem"}],"origin":[{"dateIssuedKey":"2006","dateIssuedDisp":"2006"}],"id":{"eki":["1634620615"]}} | ||
| SRT | |a AHRDINOREITABUSEARCH2006 | ||