Solving mixed 0-1 knapsack problems using Fenchel cutting planes /
(MIXCUT) is developed to generate the cutting planes for
| 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: | (MIXCUT) is developed to generate the cutting planes for algorithm iteratively. A major advantage of the algorithm is and variable separation are two main techniques used to Cutting-plane methods have shown their unique advantage in generate Fenchel cuts. Once a Fenchel cut is generated, a is called Fenchel cuts. They are generated by solving a knowledge of the polyhedral facial structure of the problem. mixed 0-1 knapsack problem can be solved by using MIXCUT mixed 0-1 knapsack problems. The class of the cutting planes of the algorithm. Our test results demonstrated the expected good performance polyhedral structure of the IP problem. Dynamic programming separation problem instead of using explicit knowledge of the solving IP problems. In this research, a new algorithm that a mixed 0-1 knapsack problem can be solved without any |
|---|---|
| Item Description: | "Major subject: Industrial Engineering". Vita. |
| Physical Description: | viii, 39 leaves : illustrations ; 28 cm. Also available online. Issued also on microfiche from Lange Micrographics. |
| Bibliography: | Includes bibliographical references. |