A modification of the method of combinatorial truncation in optimization problems over vertex-located sets

DOI10.1007/S10559-009-9147-8zbMath1188.90226OpenAlexW1976716277MaRDI QIDQ844364

O. A. Yemets, Ye. M. Yemets

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

zbMATH Keywords

permutationsdegenerate solutions of linear programming problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (8)

Theory and methods of Euclidian combinatorial optimization: current status and prospects ⋮ 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 ⋮ 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 ⋮ Games with combinatorial constraints ⋮ Combinatorial optimization under uncertainty

Cites Work

• Solution of optimization problems with fractional-linear objective functions and additional linear constraints on permutations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A modification of the method of combinatorial truncation in optimization problems over vertex-located sets