A modification of the method of combinatorial truncation in optimization problems over vertex-located sets
From MaRDI portal
Publication:844364
DOI10.1007/s10559-009-9147-8zbMath1188.90226MaRDI QIDQ844364
Publication date: 19 January 2010
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-009-9147-8
90C27: Combinatorial optimization
Related Items
Solution of mixed combinatorial optimization problems on arrangements by the method of construction of lexicographic equivalence, Analysis of mathematical models and methods of solving combinatorial optimization problems on game-type permutations, Games with combinatorial constraints, Combinatorial optimization under uncertainty, Description and generation of permutations containing cycles, Generating combinatorial sets with given properties, The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations
Cites Work