Integer programming: Difference between revisions

Content deleted Content added
m Remove unneeded grammatical article from short description and general fixes
Scheduling: Removed redundant and grammatically ill-formed sentences at end
Line 86:
===Scheduling===
 
These problems involve service and vehicle scheduling in transportation networks. For example, a problem may involve assigning buses or subways to individual routes so that a timetable can be met, and also to equip them with drivers. Here binary decision variables indicate whether a bus or subway is assigned to a route and whether a driver is assigned to a particular train or subway. The zero–one programming technique has been successfully applied to solve a project selection problem in which projects are mutually exclusive and/or technologically interdependent. It is used in a special case of integer programming, in which all the decision variables are integers. Variable can assume only the values zero or one.
 
===Territorial partitioning===