Name
Abstract | ||
|---|---|---|
By starting with an all-integer zero-one linear programming problem, it is possible to develop a modified, possibly linear, programming problem that provides a characterization of the basis corresponding to a feasible zero-one solution to the integer problem. This characterization is based on the number of variables equal to one in the feasible solution. This paper develops an approach to zero-one programming based on this characterization. The method uses the criterion function of the original problem as a constraint, and then generates a sequence of feasible zero-one solutions, each with a greater value of the objective function. The solution technique is terminated when no more feasible solutions can be found, indicating that the last feasible solution determined is the optimum. |
Year | DOI | Venue |
|---|---|---|
1968 | 10.1287/opre.16.6.1206 | Operations Research |
Field | DocType | Volume |
Linear-fractional programming,Constraint satisfaction,Cutting-plane method,Mathematical optimization,Active set method,Branch and price,Integer programming,Cutting stock problem,Linear programming,Mathematics | Journal | 16 |
Issue | ISSN | Citations |
6 | 0030-364X | 4 |
PageRank | References | Authors |
9.93 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. V. Cabot | 1 | 21 | 18.17 |
| A. P. Hurter | 2 | 78 | 38.65 |