The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations (Q2263322): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:27, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations |
scientific article |
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
