The multi-stop aircraft routing problem /
and describe formulation refinements which facilitate
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1995.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Summary: | and describe formulation refinements which facilitate function is the net result of the difference between revenues in each segment route. The objective of the aircraft routing included. inequalities are presented. Computational results are also model takes the form of a 0/1 mixed integer linear program per passenger carried and aircraft operating costs. The polynomial separation algorithms associated with the valid presenting additional valid inequalities. In addition, problem is to maximize the profit derived from the routing problem includes 0/1 mixed rows, we first derive solution. Since the constraint set of the multi-stop aircraft the sequence of stops and the number of passengers to carry these results to the constraint set of the routing problem, transportation of passengers over the route. The objective valid inequalities for this type of regions. Then we apply We study the multi-stop aircraft routing problem, determining |
|---|---|
| Item Description: | "Major subject: Industrial Engineering". Vita. |
| Physical Description: | viii, 75 leaves : illustrations ; 28 cm. Also available online. Issued also on microfiche from Lange Micrographics. |
| Bibliography: | Includes bibliographical references. |