Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method

DOI10.1007/s10559-012-9462-3zbMath1307.90178OpenAlexW2012581850MaRDI QIDQ2263228

O. A. Iemets, O. A. Chernenko, Ivan V. Sergienko

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-9462-3

zbMATH Keywords

optimizationarrangementbranch and bound methodfractional linear objective function

Mathematics Subject Classification ID

Fractional programming (90C32) Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (3)

Optimal search for locally feasible solutions of a linear function on permutations ⋮ Theory and methods of Euclidian combinatorial optimization: current status and prospects ⋮ Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method

Cites Work

• Unnamed Item
• Transportation problems on permutations: properties of estimates in the branch and bound method
• Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method
• Solving optimization problems with linear-fractional objective functions and additional constraints on the arrangements
• An Automatic Method of Solving Discrete Programming Problems

This page was built for publication: Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method