Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements

DOI10.1007/S10559-012-9433-8zbMATH Open1308.90148OpenAlexW2074790057MaRDI QIDQ2263199FDOQ2263199

Authors: O. O. Iemetsa, O. O. Yemetsa 

Publication date: 18 March 2015

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

Full work available at URL: https://doi.org/10.1007/s10559-012-9433-8

Recommendations

• Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method
• Solving linear optimization problems on arrangements by the truncation method
• scientific article; zbMATH DE number 2118655
• Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method
• Solution of optimization problems with fractional-linear objective functions and additional linear constraints on permutations

zbMATH Keywords

arrangementscombinatorial optimizationbranch and bound method

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Properties of the linear unconditional problem of combinatorial optimization on arrangements under probabilistic uncertainty
• Title not available (Why is that?)
• Games with combinatorial constraints

Cited In (6)

• Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method
• Title not available (Why is that?)
• Solving linear optimization problems on arrangements by the truncation method
• Title not available (Why is that?)
• Title not available (Why is that?)
• Transportation problems on permutations: properties of estimates in the branch and bound method

This page was built for publication: Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2263199)