Found 97029 papers in total
1989,
The problem of finding the set of alternatives for multicriterion problems of matchings, paths, and chains...
1991,
A class of algorithms is proposed for solving linear programming problems (with m inequality constraints)...
1990,
By taking into consideration the users consumption curve, the daily/weekly/monthly scheduling, requested...
1990,
This paper considers multiobjective linear programming problems with both fuzzy parameters and fuzzy...
1990,
This paper, focuses on multiobjective linear programming problems with fuzzy parameters and introduces a...
1991,
Complete efficiency in multiple objective programming may be more common than has been thought, especially...
1992,
For a possibly degenerate linear program ( A is an real matrix, and ), whose optimal value is 0, a study...
1991,
Nonlinear network optimization is of great importance not only in theory but also in practical...
1988,
The continuous analogue of a multifactor non-linear problem of mathematical programming of high...
1988,
An approach to constructing methods for solving the non-linear programming problem in which direction...
1991,
Using some properties of semi-differentiable functions, the authors give a sufficient optimality condition...
1991,
This paper focuses on two themes within the broad context of recursively definable graph classes. First,...
1991,
Given a graph G , the maximum cut problem consists of finding the subset S of vertices such that the...
1991,
The concept of a branch weight centroid has been extended in [12] so that it can be defined for an...
1991,
Given a directed graph, the authors consider the problem of finding a rooted directed tree (or branching)...
1991,
Let M be a metric space and P a finite set of points in M. The Steiner ratio in M is defined to be...
1991,
An xcut of a set is defined to be a partition of V into two disjoint nonempty subsets such that both i and...
1991,
The authors formulate and investigate the Multi-Weighted Steiner Problem (MWS), a generalization of the...
1991,
The authors present a scheme to solve the Steiner problem in directed graphs using a heuristic method to...
1991,
Suppose n points are given in the plane. Their coordinates form a 2n -vector X . To study the question of...
1991,
It was conjectured by Gilbert and Pollak that for any finite set of points in the Euclidean plane, the...
1991,
This paper considers the problem of finding minimal length tree networks on the unit sphere ℝlsquo;...
1991,
A Steiner tree problem on the plane is that of finding a minimum length Steiner tree connecting a given...
1991,
The authors present a simple, direct proof of Hwang’s characterization of rectilinear Steiner...
Papers per page: