Library Subscription: Guest
Journal of Automation and Information Sciences

Published 12 issues per year

ISSN Print: 1064-2315

ISSN Online: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Properties of Combinatorial Optimization Unconstrained Problems on Arrangements with Linear and Linear-Fractional Objective Functions

Volume 49, Issue 1, 2017, pp. 41-52
DOI: 10.1615/JAutomatInfScien.v49.i1.40
Get accessGet access

ABSTRACT

The properties of unconstrained Euclidean problems of combinatorial optimization on arrangements with linear and linear-fractional objective functions are considered. It is shown that every extremal in linear problem is element of certain set of polyarangements. For problems with linear- fractional objective function it was substantiated the way of formation of the set of all extremals, if one of them is known.

CITED BY
  1. Barbolina Tetiana, Estimates of objective function minimum for solving linear fractional unconstrained combinatorial optimization problems on arrangements, Physico-mathematical modelling and informational technologies, 32, 2021. Crossref

Begell Digital Portal Begell Digital Library eBooks Journals References & Proceedings Research Collections Prices and Subscription Policies Begell House Contact Us Language English 中文 Русский Português German French Spain