|
The best known application is to
Airline Crew Scheduling.
A set of
flight legs (between cities) are given that must be flown.
Each
constraint (row) represents a flight leg. Feasible trips
(i.e., a sequence of flight legs) for crews need
to be chosen (columns of constraint matrix).
|
|
An
SDP relaxation for the SPP
J.E. Beasley's home page
has a section on
set
covering /
partitioning.
The OR-Library
has
test data sets for
set
partitioning.
|