Solving the probabilistic profitable tour problem on a line (Q6081600): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-022-01960-z / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W4313479883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and approximation for traveling salesman problems with profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: The probabilistic orienteering 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: A branch-and-cut algorithm for the capacitated profitable tour problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-022-01960-Z / rank
 
Normal rank

Latest revision as of 18:16, 30 December 2024

scientific article; zbMATH DE number 7755345
Language Label Description Also known as
English
Solving the probabilistic profitable tour problem on a line
scientific article; zbMATH DE number 7755345

    Statements

    Solving the probabilistic profitable tour problem on a line (English)
    0 references
    0 references
    0 references
    0 references
    26 October 2023
    0 references
    traveling salesman problem with profits
    0 references
    probabilistic profitable tour problem
    0 references
    polynomial time complexity
    0 references

    Identifiers