Development of an exact method for zero-one linear programming model
The paper presents a new method for solving the 0–1 linear programming problems (LPs). The general 0–1 LPs are believed to be NP-hard and a consistent, efficient general-purpose algorithm for these models has not been found so far. Cutting planes and branch and bound approaches were the earliest exa...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
PC Technology Center
2020-10-01
|
| Series: | Eastern-European Journal of Enterprise Technologies |
| Subjects: | |
| Online Access: | http://journals.uran.ua/eejet/article/view/211793 |