Polynomial subcases of the home health care routing and scheduling problem with fixed services
Year: 2018
Type: conference-paper
Source: HAL
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Keywords: interval graphs, chordal graphs, perfect elimination orderings, greedy coloring, comparability graphs, transitive orientation, Dilworth's theorem, chain decomposition, polynomial-time algorithms, travel time, triangle inequality, graph coloring, graph partitioning, NP-hard problems, vehicle routing
Open Access status: closed
OpenAlex ID: W3154875263
