Line: 1 to 1 | ||||||||
---|---|---|---|---|---|---|---|---|
<-- Under Construction --> | ||||||||
Line: 26 to 26 | ||||||||
Operations Research Topics: IntegerProgrammingApplication Areas: RosteringContents | ||||||||
Changed: | ||||||||
< < | ||||||||
> > | ||||||||
Problem DescriptionAdapted from a real-world problem An airline is trying to roster captains for 6 flights. The flight schedules are:![]() ![]()
| ||||||||
Line: 36 to 34 | ||||||||
Return to top
Problem Formulation | ||||||||
Changed: | ||||||||
< < | The formulation... | |||||||
> > | The formulation... | |||||||
Return to top
Computational Model | ||||||||
Changed: | ||||||||
< < | The computational model... | |||||||
> > | The computational model... | |||||||
Return to top
Results | ||||||||
Changed: | ||||||||
< < | The results... | |||||||
> > | The results... | |||||||
Return to top
Conclusions | ||||||||
Changed: | ||||||||
< < | In conclusion... | |||||||
> > | In conclusion... | |||||||
Return to top | ||||||||
Changed: | ||||||||
< < | ||||||||
> > | <-- --> | |||||||
Changed: | ||||||||
< < | ||||||||
> > | <-- | |||||||