Matches in UGent Biblio for { <https://biblio.ugent.be/publication/1148960#aggregation> ?p ?o. }
Showing items 1 to 31 of
31
with 100 items per page.
- aggregation classification "C3".
- aggregation creator B71254.
- aggregation creator B71255.
- aggregation creator person.
- aggregation date "2011".
- aggregation format "application/pdf".
- aggregation hasFormat 1148960.bibtex.
- aggregation hasFormat 1148960.csv.
- aggregation hasFormat 1148960.dc.
- aggregation hasFormat 1148960.didl.
- aggregation hasFormat 1148960.doc.
- aggregation hasFormat 1148960.json.
- aggregation hasFormat 1148960.mets.
- aggregation hasFormat 1148960.mods.
- aggregation hasFormat 1148960.rdf.
- aggregation hasFormat 1148960.ris.
- aggregation hasFormat 1148960.txt.
- aggregation hasFormat 1148960.xls.
- aggregation hasFormat 1148960.yaml.
- aggregation isPartOf urn:isbn:9789490695521.
- aggregation language "eng".
- aggregation rights "I have retained and own the full copyright for this publication".
- aggregation subject "Technology and Engineering".
- aggregation title "Orienteering problem with hotel selection".
- aggregation abstract "In the regular Team Orienteering Problem, a set of locations is given, each with a score. The goal is to determine a fixed number of trips, each within a given time budget, in order to maximize the total collected score. All trips start (and end) at the same starting point. The Orienteering Problem with Hotel Selection (OPHS) also has a fixed number of trips, but each trip can end in any of the available hotels and the next trip should start in the same hotel. In the ongoing research, we formulate the OPHS mathematically, develop a heuristic to solve it and design appropriate benchmark instances.".
- aggregation authorList BK181222.
- aggregation endPage "86".
- aggregation startPage "85".
- aggregation aggregates 1148982.
- aggregation isDescribedBy 1148960.
- aggregation similarTo LU-1148960.