The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations (Q2263322)
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 6416372
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations |
scientific article; zbMATH DE number 6416372 |
Statements
The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations (English)
0 references
18 March 2015
0 references
set of permutations
0 references
permutation polyhedron graph
0 references
method of cutting graph vertices
0 references
linear optimization on permutations
0 references
0 references
0 references
0.7809426784515381
0 references
0.7692210674285889
0 references
0.764748215675354
0 references
