Classes of lexicographic equivalence in Euclidean combinatorial optimisation on arrangements (Q5439037): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An irreducible set of combinatorial polyhedron constraints in the linear-fractional optimisation problem on permutations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Construction of convex continuations for functions defined on a hypersphere / rank | |||
Normal rank | |||
Latest revision as of 15:35, 27 June 2024
scientific article; zbMATH DE number 5233530
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Classes of lexicographic equivalence in Euclidean combinatorial optimisation on arrangements |
scientific article; zbMATH DE number 5233530 |
Statements
Classes of lexicographic equivalence in Euclidean combinatorial optimisation on arrangements (English)
0 references
8 February 2008
0 references
