Direct cut-off method for combinatorial optimization problems with additional constraints

DOI10.1007/S10559-011-9372-9zbMath1298.90085OpenAlexW2086945908MaRDI QIDQ464988

Ye. M. Yemets, Yu. F. Oleksiichuk, O. O. Iemets

Publication date: 30 October 2014

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

Full work available at URL: https://doi.org/10.1007/s10559-011-9372-9

zbMATH Keywords

combinatorial optimizationcombinatorial cut-off methodpolyarrangement

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

Properties of the linear unconditional problem of combinatorial optimization on arrangements under probabilistic uncertainty ⋮ Systems of linear equations with fuzzy set data: weak solvability and weak admissibility

Cites Work

• Unnamed Item
• Solving linear optimization problems on arrangements by the truncation method
• Combinatorial optimization model of packing rectangles with stochastic parameters
• Method of ordering the values of a linear function on a set of permutations
• Algorithmic solution of two parametric optimization problems of a set of complete combinations
• Solution of Euclidean combinatorial optimization problems by the method of construction of a lexicographic equivalence
• On the Solution of Problems of Nonlinear Conditional Optimization on Arrangements by the Cut-Off Method

This page was built for publication: Direct cut-off method for combinatorial optimization problems with additional constraints