Inter programming models for the target visitation problem
The target visitation problem (TVP) is concerned with finding a route to visit a set of targets starting - from and returning to some base. In addition to the distance traveled a tour is evaluated by taking also - preferences into account which address the sequence in which the targets are visited....
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
2015
|
| In: |
Informatica
Year: 2015, Volume: 39, Issue: 3, Pages: 257-260 |
| ISSN: | 0350-5596 |
| Online Access: | Verlag, lizenzpflichtig, Volltext: http://www.informatica.si/index.php/informatica/article/view/981
|
| Author Notes: | Achim Hildenbrandt, Gerhard Reinelt |
MARC
| LEADER | 00000caa a2200000 c 4500 | ||
|---|---|---|---|
| 001 | 1731797621 | ||
| 003 | DE-627 | ||
| 005 | 20220818195321.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 200914s2015 xx |||||o 00| ||eng c | ||
| 035 | |a (DE-627)1731797621 | ||
| 035 | |a (DE-599)KXP1731797621 | ||
| 035 | |a (OCoLC)1341359595 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rda | ||
| 041 | |a eng | ||
| 084 | |a 28 |2 sdnb | ||
| 100 | 1 | |a Hildenbrandt, Achim |e VerfasserIn |0 (DE-588)1044411015 |0 (DE-627)772025789 |0 (DE-576)397198337 |4 aut | |
| 245 | 1 | 0 | |a Inter programming models for the target visitation problem |c Achim Hildenbrandt, Gerhard Reinelt |
| 264 | 1 | |c 2015 | |
| 300 | |a 4 | ||
| 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 14.09.2020 | ||
| 520 | |a The target visitation problem (TVP) is concerned with finding a route to visit a set of targets starting - from and returning to some base. In addition to the distance traveled a tour is evaluated by taking also - preferences into account which address the sequence in which the targets are visited. The problem thus - is a combination of two well-known combinatorial optimization problems: the traveling salesman and the - linear ordering problem. In this paper we point out some polyhedral properties and develop a branch-andcut - algorithm for solving the TVP to optimality. Some computational results are presented. | ||
| 700 | 1 | |a Reinelt, Gerhard |e VerfasserIn |0 (DE-588)101987113X |0 (DE-627)691042861 |0 (DE-576)358936187 |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Informatica |d Ljubljana : Slovene Soc. Informatika, 1977 |g 39(2015), 3, Seite 257-260 |h Online-Ressource |w (DE-627)504527681 |w (DE-600)2212804-9 |w (DE-576)281294321 |x 0350-5596 |7 nnas |a Inter programming models for the target visitation problem |
| 773 | 1 | 8 | |g volume:39 |g year:2015 |g number:3 |g pages:257-260 |g extent:4 |a Inter programming models for the target visitation problem |
| 856 | 4 | 0 | |u http://www.informatica.si/index.php/informatica/article/view/981 |x Verlag |z lizenzpflichtig |3 Volltext |
| 951 | |a AR | ||
| 992 | |a 20200914 | ||
| 993 | |a Article | ||
| 994 | |a 2015 | ||
| 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 | ||
| 998 | |g 1044411015 |a Hildenbrandt, Achim |m 1044411015:Hildenbrandt, Achim |d 110000 |d 110300 |e 110000PH1044411015 |e 110300PH1044411015 |k 0/110000/ |k 1/110000/110300/ |p 1 |x j | ||
| 999 | |a KXP-PPN1731797621 |e 375290366X | ||
| BIB | |a Y | ||
| SER | |a journal | ||
| JSO | |a {"language":["eng"],"recId":"1731797621","type":{"bibl":"article-journal","media":"Online-Ressource"},"note":["Gesehen am 14.09.2020"],"title":[{"title_sort":"Inter programming models for the target visitation problem","title":"Inter programming models for the target visitation problem"}],"person":[{"given":"Achim","family":"Hildenbrandt","role":"aut","roleDisplay":"VerfasserIn","display":"Hildenbrandt, Achim"},{"family":"Reinelt","given":"Gerhard","roleDisplay":"VerfasserIn","display":"Reinelt, Gerhard","role":"aut"}],"relHost":[{"title":[{"title_sort":"Informatica","title":"Informatica","subtitle":"an international journal of computing and informatics"}],"type":{"media":"Online-Ressource","bibl":"periodical"},"disp":"Inter programming models for the target visitation problemInformatica","note":["Gesehen am 13.07.09"],"corporate":[{"role":"isb","roleDisplay":"Herausgebendes Organ","display":"Slovensko društvo informatika"}],"language":["slv"],"recId":"504527681","pubHistory":["1.1977 -"],"part":{"issue":"3","pages":"257-260","year":"2015","extent":"4","text":"39(2015), 3, Seite 257-260","volume":"39"},"titleAlt":[{"title":"Journal of computing and informatics"}],"name":{"displayForm":["Slovenian Society Informatika"]},"origin":[{"publisherPlace":"Ljubljana","dateIssuedDisp":"1977-","publisher":"Slovene Soc. Informatika","dateIssuedKey":"1977"}],"id":{"eki":["504527681"],"zdb":["2212804-9"],"issn":["0350-5596"]},"physDesc":[{"extent":"Online-Ressource"}]}],"physDesc":[{"extent":"4 S."}],"id":{"eki":["1731797621"]},"origin":[{"dateIssuedKey":"2015","dateIssuedDisp":"2015"}],"name":{"displayForm":["Achim Hildenbrandt, Gerhard Reinelt"]}} | ||
| SRT | |a HILDENBRANINTERPROGR2015 | ||