Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving combinatorial optimization problems using Karmarkar's algorithm |
scientific article; zbMATH DE number 77868
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving combinatorial optimization problems using Karmarkar's algorithm |
scientific article; zbMATH DE number 77868 |
Statements
Solving combinatorial optimization problems using Karmarkar's algorithm (English)
0 references
17 December 1992
0 references
This paper presents a cutting plane algorithm for solving combinatorial optimization problems. The primal projective standard-form variant of Karmarkar's algorithm for linear programming is applied to the duals of a sequence of linear programming relaxations of the combinatorial optimization problem. The computational experience with this algorithm on matching problems is described.
0 references
cutting plane algorithm
0 references
Karmarkar's algorithm
0 references
matching
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
