Add to ORKGThe paper deals with a new method of solving a combinatorial problem with account for the properties of the set of permutations and its structure. Using this method, the values of the linear objective function are sequenced and the set of permutations is decomposed over hyperplanes, with account of element recurrences. This makes it possible to develop an algorithm of finding the point (an element of the set of permutations) at which the objective function attains a given value
148 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986.This thesis presents topics i...
Combinatorial optimization problems appear in many disciplines ranging from management and logistics...
summary:A lower bound for the number of comparisons is obtained, required by a computational problem...
The paper deals with a new method of solving a combinatorial problem with account for the properties...
The problem of finding an extremum of a linear function over a permutation set is considered. The po...
The problem of finding an extremum of a linear function over a permutation set is considered. The po...
The statement of a problem of Euclidean combinatorial optimization with a fractional-linear objectiv...
Complex discrete multicriteria problems over a combinatorial set of permutations are analyzed. Some ...
We consider an optimization problem on permutations with a linear-fractional objective function. We ...
The statement of a problem of Euclidean combinatorial optimization with a fractional-linear objectiv...
The studies on multicriteria combinatorial optimization are continued. A possible approach to solvin...
Combinatorial optimization problems appear in many disciplines ranging from management and logistic...
In this paper we describe and implement an algorithm for the exact solution of the Linear Ordering p...
Combinatorial optimization problems appear in many disciplines ranging from management and logistic...
A water company decides to expand its network with a set of water lines, but it cannot build them al...
148 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986.This thesis presents topics i...
Combinatorial optimization problems appear in many disciplines ranging from management and logistics...
summary:A lower bound for the number of comparisons is obtained, required by a computational problem...
The paper deals with a new method of solving a combinatorial problem with account for the properties...
The problem of finding an extremum of a linear function over a permutation set is considered. The po...
The problem of finding an extremum of a linear function over a permutation set is considered. The po...
The statement of a problem of Euclidean combinatorial optimization with a fractional-linear objectiv...
Complex discrete multicriteria problems over a combinatorial set of permutations are analyzed. Some ...
We consider an optimization problem on permutations with a linear-fractional objective function. We ...
The statement of a problem of Euclidean combinatorial optimization with a fractional-linear objectiv...
The studies on multicriteria combinatorial optimization are continued. A possible approach to solvin...
Combinatorial optimization problems appear in many disciplines ranging from management and logistic...
In this paper we describe and implement an algorithm for the exact solution of the Linear Ordering p...
Combinatorial optimization problems appear in many disciplines ranging from management and logistic...
A water company decides to expand its network with a set of water lines, but it cannot build them al...
148 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986.This thesis presents topics i...
Combinatorial optimization problems appear in many disciplines ranging from management and logistics...
summary:A lower bound for the number of comparisons is obtained, required by a computational problem...