No label defined (Q4496022)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1489805
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1489805 |
Statements
5 August 2001
0 references
Boolean programming
0 references
linear ordering problem
0 references
zero-one linear programming
0 references
interior point cutting plane method
0 references
simplex cutting plane method
0 references
0.866271436214447
0 references
0.8295015692710876
0 references
0.7784896492958069
0 references
The linear ordering problem, that has application in economics, archaeology, scheduling, the social sciences, and aggregation of individual preferences, can be written as a zero-one linear programming problem and is NP-hard. An algorithm combining an interior point cutting plane method, for the first iterations, with the use of a simplex cutting plane method for the remaining iterations, is proposed. Computational results on randomly generated test problems between 100 and 250 objects, i.e. up to 31125 variables and 10000 constraints show that the combined strategy performs significantly better than a pure strategy that uses only an interior point or only a simplex method in order to solve the problem. For the entire collection see [Zbl 0933.00020].
0 references