Online traveling salesman problems with service flexibility (Q3100693): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.20454 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2132632316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of lookahead in on-line server routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive analysis for dynamic multiperiod uncapacitated routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive analysis of a dispatch policy for a dynamic multi-period routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2728857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The online prize-collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the on-line quota traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the on-line travelling salesman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Online TSP Against Fair Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line single-server dial-a-ride problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing competitive tours from local information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive snoopy caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:38, 4 July 2024

scientific article
Language Label Description Also known as
English
Online traveling salesman problems with service flexibility
scientific article

    Statements

    Online traveling salesman problems with service flexibility (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 November 2011
    0 references
    0 references
    online algorithms
    0 references
    traveling salesman
    0 references
    prize-collecting
    0 references
    0 references