On-line single-server dial-a-ride problems (Q5958715): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel / 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: Searching in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum latency problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Ensemble Motion Planning on a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonpreemptive Ensemble Motion Planning on a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing a vehicle of capacity greater than one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer-Aided Complexity Classification of Dial-a-Ride Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs that arrive over time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The General Pickup and Delivery Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Parallel Machines On-Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368485 / rank
 
Normal rank

Revision as of 22:28, 3 June 2024

scientific article; zbMATH DE number 1715760
Language Label Description Also known as
English
On-line single-server dial-a-ride problems
scientific article; zbMATH DE number 1715760

    Statements

    Identifiers