Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets
Data up to Jan 2025
Total Citations Per Year
Abstract
References (11)
Flows in networks
1962 • 4,199 citations
Algorithmic Graph Theory and Perfect Graphs
2004 • 3,945 citations
A Decomposition Theorem for Partially Ordered Sets
2009 • 1,039 citations
The Complexity of Coloring Circular Arcs and Chords
1980 • 399 citations
Minimizing the number of tankers to meet a fixed schedule
1954 • 292 citations
Coloring a Family of Circular Arcs
1975 • 221 citations
Note on Dilworth’s decomposition theorem for partially ordered sets
1956 • 124 citations
An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs
1981 • 57 citations
An algorithm for the minimum number of transport units to maintain a fixed schedule
1957 • 38 citations
The complexity of dynamic languages and dynamic optimization problems
1981 • 38 citations
Scheduling and routing models for airline systems
1969 • 34 citations