An irreducible set of combinatorial polyhedron constraints in the linear-fractional optimisation problem on permutations

DOI10.1515/DMA.2001.11.1.95zbMath1134.90548OpenAlexW2025427063MaRDI QIDQ4809514

O. A. Emets, S. I. Nedobachiĭ, L. N. Kolechkina

Publication date: 30 August 2004

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

Full work available at URL: http://mathnet.ru/eng/dm/13/1/110

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Fractional programming (90C32)

Related Items (1)

Classes of lexicographic equivalence in Euclidean combinatorial optimisation on arrangements

This page was built for publication: An irreducible set of combinatorial polyhedron constraints in the linear-fractional optimisation problem on permutations