Analysis of an algorithm for solution of conditional optimization problems with linear-fractional objective functions over permutations
From MaRDI portal
Publication:2480505
DOI10.1007/s10559-007-0083-1zbMath1144.90472MaRDI QIDQ2480505
Publication date: 31 March 2008
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-007-0083-1
set of permutationslinear-fractional functionEuclidean optimization problemmethod of constructing lexicographic equivalence
Cites Work
- Solving linear optimization problems on arrangements by the truncation method
- Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method
- Solution of Euclidean combinatorial optimization problems by the method of construction of a lexicographic equivalence
- A nonreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on arrangements
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item