New Bounds for Maximizing Revenue in Online Dial-a-Ride (Q5041189): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2728857 / 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: Q5090461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Online TSP on the Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Revenues for On-Line Dial-a-Ride / 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: Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Vehicle Routing Problems: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online travelling salesman problem on a circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typology and literature review for dial-a-ride problems / rank
 
Normal rank

Latest revision as of 10:47, 30 July 2024

scientific article; zbMATH DE number 7601007
Language Label Description Also known as
English
New Bounds for Maximizing Revenue in Online Dial-a-Ride
scientific article; zbMATH DE number 7601007

    Statements