New heuristics and lower bounds for the min-max k-chinese postman problem
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Dokumenttyp: | Kapitel/Artikel |
| Sprache: | Englisch |
| Veröffentlicht: |
2002
|
| In: |
Algorithms
Year: 2002, Pages: 64-74 |
| Online-Zugang: |
|
| Verfasserangaben: | Dino Ahr, Gerhard Reinelt |
MARC
| LEADER | 00000caa a22000002c 4500 | ||
|---|---|---|---|
| 001 | 1441686185 | ||
| 003 | DE-627 | ||
| 005 | 20220810190038.0 | ||
| 007 | tu | ||
| 008 | 120927s2002 xx ||||| 00| ||eng c | ||
| 035 | |a (DE-627)1441686185 | ||
| 035 | |a (DE-576)371686180 | ||
| 035 | |a (DE-599)BSZ371686180 | ||
| 035 | |a (OCoLC)1340428437 | ||
| 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 | 0 | |a New heuristics and lower bounds for the min-max k-chinese postman problem |c Dino Ahr, Gerhard Reinelt |
| 264 | 1 | |c 2002 | |
| 300 | |a 11 | ||
| 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 Algorithms |d Berlin : Springer, 2002 |g (2002), Seite 64-74 |h XIV, 917 S. |w (DE-627)353322814 |w (DE-576)100683339 |z 3540441808 |7 nnam |a New heuristics and lower bounds for the min-max k-chinese postman problem |
| 773 | 1 | 8 | |g year:2002 |g pages:64-74 |g extent:11 |a New heuristics and lower bounds for the min-max k-chinese postman problem |
| 951 | |a AR | ||
| 992 | |a 20120927 | ||
| 993 | |a BookComponentPart | ||
| 994 | |a 2002 | ||
| 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-PPN1441686185 |e 2724229118 | ||
| BIB | |a Y | ||
| JSO | |a {"recId":"1441686185","language":["eng"],"relHost":[{"id":{"eki":["353322814"],"isbn":["3540441808"]},"origin":[{"publisherPlace":"Berlin ; Heidelberg [u.a.]","dateIssuedDisp":"2002","dateIssuedKey":"2002","publisher":"Springer"}],"name":{"displayForm":["ESA 2002, Rome, Italy, September 17 - 21, 2002. Rolf Möhring; Rajeev Raman (eds.)"]},"relMultPart":[{"recId":"129300152","language":["eng"],"disp":"Lecture notes in computer science","type":{"bibl":"serial"},"note":["Ersch. teils auch als CD-ROM-Ausgabe","Das Gesamtwerk gliedert sich in: Lecture notes in artificial intelligence; Lecture notes in bioinformatics; Journal subline; Advanced research in computing and software science; FoLLI publications on logic, language and information"],"titleAlt":[{"title":"LNCS"},{"title":"LNAI"},{"title":"LNBI"},{"title":"LNCS-LNAI"},{"title":"LNCS-LNBI"},{"title":"LNCS-ARCoSS"}],"part":{"number_sort":["2461"],"number":["2461"]},"pubHistory":["1.1973 -"],"title":[{"title":"Lecture notes in computer science","title_sort":"Lecture notes in computer science"}],"physDesc":[{"noteFormat":"24 cm"}],"dispAlt":"Lecture notes in computer science","id":{"zdb":["121909-1"],"eki":["129300152"],"issn":["0302-9743"]},"origin":[{"publisherPlace":"Berlin, Germany ; Heidelberg, Germany ; Berlin ; Heidelberg ; New York, NY","publisher":"Springer ; Springer","dateIssuedKey":"1973","dateIssuedDisp":"1973-"}]}],"physDesc":[{"noteIll":"graph. Darst.","noteFormat":"24 cm","extent":"XIV, 917 S."}],"title":[{"subtitle":"10th annual European symposium ; proceedings","title":"Algorithms","title_sort":"Algorithms"}],"person":[{"family":"Möhring","given":"Rolf H.","roleDisplay":"Hrsg.","display":"Möhring, Rolf H.","role":"edt"},{"roleDisplay":"Hrsg.","display":"Möhring, Rolf H.","role":"edt","family":"Möhring","given":"Rolf H."},{"given":"Rajeev","family":"Raman","role":"edt","display":"Raman, Rajeev","roleDisplay":"Hrsg."}],"part":{"text":"(2002), Seite 64-74","extent":"11","year":"2002","pages":"64-74"},"language":["eng"],"corporate":[{"role":"oth","display":"European Association for Theoretical Computer Science"},{"role":"oth","display":"ESA (10, 2002, Rom)"}],"recId":"353322814","type":{"bibl":"edited-book"},"disp":"New heuristics and lower bounds for the min-max k-chinese postman problemAlgorithms"}],"type":{"bibl":"chapter"},"physDesc":[{"extent":"11 S."}],"name":{"displayForm":["Dino Ahr, Gerhard Reinelt"]},"person":[{"given":"Dino","family":"Ahr","role":"aut","display":"Ahr, Dino"},{"family":"Reinelt","given":"Gerhard","display":"Reinelt, Gerhard","role":"aut"}],"id":{"eki":["1441686185"]},"title":[{"title_sort":"New heuristics and lower bounds for the min-max k-chinese postman problem","title":"New heuristics and lower bounds for the min-max k-chinese postman problem"}],"origin":[{"dateIssuedDisp":"2002","dateIssuedKey":"2002"}]} | ||
| SRT | |a AHRDINOREINEWHEURIST2002 | ||