A branch-and-cut algorithm for the balanced traveling salesman problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jco/VoBN24
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jco/VoBN24
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Mourad_Ba%E2%88%9A%C4%AEou
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Thi_Quynh_Trang_Vo
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Viet_Hung_Nguyen
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs10878-023-01097-4
>
foaf:
homepage
<
https://doi.org/10.1007/s10878-023-01097-4
>
dc:
identifier
DBLP journals/jco/VoBN24
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs10878-023-01097-4
(xsd:string)
dcterms:
issued
2024
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jco
>
rdfs:
label
A branch-and-cut algorithm for the balanced traveling salesman problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Mourad_Ba%E2%88%9A%C4%AEou
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Thi_Quynh_Trang_Vo
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Viet_Hung_Nguyen
>
swrc:
month
March
(xsd:string)
swrc:
number
2
(xsd:string)
swrc:
pages
4
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jco/VoBN24/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jco/VoBN24
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jco/jco47.html#VoBN24
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s10878-023-01097-4
>
dc:
title
A branch-and-cut algorithm for the balanced traveling salesman problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
47
(xsd:string)