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 OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4745600 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4955990 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2740122 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A modification of the method of combinatorial truncation in optimization problems over vertex-located sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4828109 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Method of ordering the values of a linear function on a set of permutations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3673576 / rank | |||
Normal rank | |||
Revision as of 20:00, 9 July 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
0 references
