The capacitated team orienteering problem with incomplete service (Q375974): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-012-0559-4 / rank
Normal rank
 
Property / author
 
Property / author: H. S. Yoon / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B22 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6221903 / rank
 
Normal rank
Property / zbMATH Keywords
 
capacitated team orienteering problem
Property / zbMATH Keywords: capacitated team orienteering problem / rank
 
Normal rank
Property / zbMATH Keywords
 
incomplete service
Property / zbMATH Keywords: incomplete service / rank
 
Normal rank
Property / zbMATH Keywords
 
split deliveries
Property / zbMATH Keywords: split deliveries / rank
 
Normal rank
Property / zbMATH Keywords
 
exact algorithms
Property / zbMATH Keywords: exact algorithms / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976539420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal solutions for routing problems with profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: The split delivery capacitated team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated team orienteering problem with incomplete service / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated team orienteering and profitable tour problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for team orienteering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the multiple tour maximum collection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2956989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A path relinking approach for the team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated local search for the team orienteering problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A TABU search heuristic for the team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the multi-period orienteering problem with multiple time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Team Orienteering Problem: Formulations and Branch-Cut and Price / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-012-0559-4 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:44, 9 December 2024

scientific article
Language Label Description Also known as
English
The capacitated team orienteering problem with incomplete service
scientific article

    Statements

    The capacitated team orienteering problem with incomplete service (English)
    0 references
    0 references
    0 references
    1 November 2013
    0 references
    capacitated team orienteering problem
    0 references
    incomplete service
    0 references
    split deliveries
    0 references
    exact algorithms
    0 references

    Identifiers