Classes of lexicographic equivalence in Euclidean combinatorial optimisation on arrangements

DOI10.1515/DMA.2007.009zbMath1267.90120MaRDI QIDQ5439037

O. A. Emets, T. N. Barbolina

Publication date: 8 February 2008

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (1)

Properties of combinatorial optimization problems over polyhedral-spherical sets

Cites Work

• Construction of convex continuations for functions defined on a hypersphere
• An irreducible set of combinatorial polyhedron constraints in the linear-fractional optimisation problem on permutations

This page was built for publication: Classes of lexicographic equivalence in Euclidean combinatorial optimisation on arrangements