Solving linear optimization problems on arrangements by the truncation method

DOI10.1023/B:CASA.0000020230.93910.1DzbMath1066.90067OpenAlexW2090919518MaRDI QIDQ557443

T. N. Barbolina, O. A. Emets

Publication date: 30 June 2005

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:casa.0000020230.93910.1d

zbMATH Keywords

multisetcorrect truncationgeneral set of arrangementslinear optimization problem on arrangements

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (4)

Solving optimization problems with linear-fractional objective functions and additional constraints on the arrangements ⋮ Direct cut-off method for combinatorial optimization problems with additional constraints ⋮ Analysis of mathematical models and methods of solving combinatorial optimization problems on game-type permutations ⋮ Analysis of an algorithm for solution of conditional optimization problems with linear-fractional objective functions over permutations

This page was built for publication: Solving linear optimization problems on arrangements by the truncation method