The clustered team orienteering problem (Q2273693): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2019.07.008 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2019.07.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2961954026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clustered orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The set orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph extraction and metaheuristics for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast two-level variable neighborhood search for the clustered vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the team orienteering problem with cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Orienteering Problem through Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orienteering problem: a survey of recent variants, solution approaches and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symmetric clustered traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating subtour elimination constraints for the TSP from pure integer solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid heuristic for the clustered orienteering problem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127465165 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2019.07.008 / rank
 
Normal rank

Latest revision as of 18:55, 17 December 2024

scientific article
Language Label Description Also known as
English
The clustered team orienteering problem
scientific article

    Statements

    The clustered team orienteering problem (English)
    0 references
    0 references
    0 references
    0 references
    25 September 2019
    0 references
    team orienteering problem
    0 references
    cluster
    0 references
    cutting plane
    0 references
    adaptive large neighborhood search
    0 references
    split procedure
    0 references

    Identifiers