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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10559-014-9649-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1981053048 / rank | |||
Normal rank | |||
Revision as of 02:41, 20 March 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
