Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method

DOI10.1007/s10559-013-9508-1zbMath1306.90130OpenAlexW1989688593MaRDI QIDQ465943

Ye. M. Yemets, T. V. Chilikina, O. O. Iemets, T. A. Parfionova

Publication date: 24 October 2014

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

Full work available at URL: https://doi.org/10.1007/s10559-013-9508-1

zbMATH Keywords

permutationscombinatorial optimizationbranch and bound method

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (2)

Properties of the linear unconditional problem of combinatorial optimization on arrangements under probabilistic uncertainty ⋮ The polyhedral-surface cutting plane method of optimization over a vertex-located set

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatorial optimization model of packing rectangles with stochastic parameters
• Transportation problems on permutations: properties of estimates in the branch and bound method

This page was built for publication: Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method