A branch and cut algorithm for the asymmetric traveling salesman problem with precedence constraints
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
2000
|
| In: |
Computational optimization and applications
Year: 2000, Volume: 17, Issue: 1, Pages: 61-84 |
| ISSN: | 1573-2894 |
| DOI: | 10.1023/A:1008779125567 |
| Online Access: | Resolving-System, Volltext: http://dx.doi.org/10.1023/A:1008779125567
|
| Author Notes: | Norbert Aschauer; Michael Jünger; Gerhard Reinelt |
MARC
| LEADER | 00000caa a22000002c 4500 | ||
|---|---|---|---|
| 001 | 1468795147 | ||
| 003 | DE-627 | ||
| 005 | 20220811044011.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 131206s2000 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1023/A:1008779125567 |2 doi | |
| 035 | |a (DE-627)1468795147 | ||
| 035 | |a (DE-576)398795142 | ||
| 035 | |a (DE-599)BSZ398795142 | ||
| 035 | |a (OCoLC)1340542866 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 084 | |a 28 |2 sdnb | ||
| 100 | 1 | |a Ascheuer, Norbert |0 (DE-627)1246193558 |0 (DE-576)176193553 |4 aut | |
| 245 | 1 | 2 | |a A branch and cut algorithm for the asymmetric traveling salesman problem with precedence constraints |c Norbert Aschauer; Michael Jünger; Gerhard Reinelt |
| 264 | 1 | |c 2000 | |
| 300 | |a 24 | ||
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Gesehen am 06.12.2013 | ||
| 700 | 1 | |a Jünger, Michael |4 aut | |
| 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 Computational optimization and applications |d New York, NY [u.a.] : Springer Science + Business Media B.V., 1992 |g 17(2000), 1, Seite 61-84 |h Online-Ressource |w (DE-627)266881297 |w (DE-600)1467967-X |w (DE-576)110350316 |x 1573-2894 |7 nnas |a A branch and cut algorithm for the asymmetric traveling salesman problem with precedence constraints |
| 773 | 1 | 8 | |g volume:17 |g year:2000 |g number:1 |g pages:61-84 |g extent:24 |a A branch and cut algorithm for the asymmetric traveling salesman problem with precedence constraints |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1023/A:1008779125567 |x Resolving-System |3 Volltext |
| 951 | |a AR | ||
| 992 | |a 20131206 | ||
| 993 | |a Article | ||
| 994 | |a 2000 | ||
| 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 3 |y j | ||
| 999 | |a KXP-PPN1468795147 |e 277808651X | ||
| BIB | |a Y | ||
| SER | |a journal | ||
| JSO | |a {"relHost":[{"physDesc":[{"extent":"Online-Ressource"}],"id":{"issn":["1573-2894"],"zdb":["1467967-X"],"eki":["266881297"]},"origin":[{"dateIssuedDisp":"1992-","dateIssuedKey":"1992","publisher":"Springer Science + Business Media B.V. ; Kluwer","publisherPlace":"New York, NY [u.a.] ; Boston [u.a.]"}],"part":{"volume":"17","text":"17(2000), 1, Seite 61-84","extent":"24","year":"2000","issue":"1","pages":"61-84"},"pubHistory":["1.1992/93 -"],"language":["eng"],"recId":"266881297","type":{"media":"Online-Ressource","bibl":"periodical"},"note":["Gesehen am 11.02.09"],"disp":"A branch and cut algorithm for the asymmetric traveling salesman problem with precedence constraintsComputational optimization and applications","title":[{"subtitle":"an international journal","title":"Computational optimization and applications","title_sort":"Computational optimization and applications"}]}],"physDesc":[{"extent":"24 S."}],"name":{"displayForm":["Norbert Aschauer; Michael Jünger; Gerhard Reinelt"]},"id":{"doi":["10.1023/A:1008779125567"],"eki":["1468795147"]},"origin":[{"dateIssuedDisp":"2000","dateIssuedKey":"2000"}],"language":["eng"],"recId":"1468795147","type":{"bibl":"article-journal","media":"Online-Ressource"},"note":["Gesehen am 06.12.2013"],"person":[{"family":"Ascheuer","given":"Norbert","display":"Ascheuer, Norbert","role":"aut"},{"display":"Jünger, Michael","role":"aut","family":"Jünger","given":"Michael"},{"role":"aut","display":"Reinelt, Gerhard","given":"Gerhard","family":"Reinelt"}],"title":[{"title":"A branch and cut algorithm for the asymmetric traveling salesman problem with precedence constraints","title_sort":"branch and cut algorithm for the asymmetric traveling salesman problem with precedence constraints"}]} | ||
| SRT | |a ASCHEUERNOBRANCHANDC2000 | ||