|
This article is cited in 4 scientific papers (total in 4 papers)
An irreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on permutations
O. A. Emets, S. I. Nedobachii, L. N. Kolechkina
Abstract:
We study a set of linear constraints determining the domain
of admissible solutions of a problem with linear objective function
to which the optimisation problem with linear–fractional objective function
on permutations is reduced.
Received: 03.07.1998 Revised: 14.03.2000
Citation:
O. A. Emets, S. I. Nedobachii, L. N. Kolechkina, “An irreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on permutations”, Diskr. Mat., 13:1 (2001), 110–118; Discrete Math. Appl., 11:1 (2001), 95–103
Linking options:
https://www.mathnet.ru/eng/dm271https://doi.org/10.4213/dm271 https://www.mathnet.ru/eng/dm/v13/i1/p110
|
Statistics & downloads: |
Abstract page: | 566 | Full-text PDF : | 264 | References: | 57 | First page: | 1 |
|