Journal: TOP

Found 192 papers in total
Rationalizations of choice functions
Rationalizations of choice functions
2000,
In this paper, we are interested in the connections between the properties of binary...
A necessary and sufficient condition to a Pareto optimal without optimizing the weighting criterion
A necessary and sufficient condition to a Pareto optimal without optimizing the weighting criterion
1997,
The easiest technique to reduce the classical multiple criteria decision problem into...
Different ways to represent weighted majority games
Different ways to represent weighted majority games
1997,
It is well known that every simple game is the intersection of weighted majority...
Some new results on least square values for TU games
Some new results on least square values for TU games
1998,
In this paper we present some new results concerning the least square family of values...
An algorithm for computing the stable coalition structures in tree-graph communication games
An algorithm for computing the stable coalition structures in tree-graph communication games
1999,
We construct an algorithm which provides in finite steps the stable coalition...
On the consistency of the Banzhaf semivalue
On the consistency of the Banzhaf semivalue
1999,
In this note we show that the Banzhaf semivalue is consistent with respect to a...
Coalitional values for cooperative games with r alternatives
Coalitional values for cooperative games with r alternatives
2000,
In this paper we consider games with n players and r alternatives. In these games the...
Implementation of the τ-value
Implementation of the τ-value
2000,
We present a finite noncooperative game in extensive form whose subgame perfect Nash...
Simple games on closure spaces
Simple games on closure spaces
2000,
Let N be a finite set. By a closure space we mean the family of the closed sets of a...
Searching for a strong double tracing in a graph
Searching for a strong double tracing in a graph
1998,
Given a connected graph G, we present a polynomial algorithm which either finds a tour...
Local optimality subsets and global optimization: A prospective approach
Local optimality subsets and global optimization: A prospective approach
2000,
We set here the problem of introducing memory into global optimization processes...
The biobjective absolute center problem
The biobjective absolute center problem
1997,
This paper deals with the problem of determining the absolute center of a network,...
An algorithmic study of the maximum flow problem: A comparative statistical analysis
An algorithmic study of the maximum flow problem: A comparative statistical analysis
2000,
In this paper, we show the results of an experimental study about the most important...
Sensitivity analysis in a class of dynamic optimization models
Sensitivity analysis in a class of dynamic optimization models
1998,
A general model of dynamic optimization, deterministic, in discrete time, and with...
The stochastic generalised assignment problem with Bernoulli demands
The stochastic generalised assignment problem with Bernoulli demands
2000,
This paper deals with the Stochastic Generalised Assignment problem. It presents...
Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization
Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization
2000,
Currently, most combinatorial optimization problems have to be solved, if the optimum...
The tolerance approach in multiobjective linear fractional programming
The tolerance approach in multiobjective linear fractional programming
1997,
When solving a multiobjective programming problem by the weighted sum approach,...
Extensions of Dinkelbach's algorithm for solving non-linear fractional programming problems
Extensions of Dinkelbach's algorithm for solving non-linear fractional programming problems
1999,
Dinkelbach's algorithm was developed to solve convex fractional programming. This...
Multiobjective fractional programming with generalized convexity
Multiobjective fractional programming with generalized convexity
2000,
This paper derives several results regarding the optimality conditions and duality...
On due-date based valid cuts for the sequential ordering problem
On due-date based valid cuts for the sequential ordering problem
1997,
The Sequential Ordering Problem with precedence relationships was introduced in...
On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0–1 knapsack constraint
On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0–1 knapsack constraint
1999,
In this short note we obtain the full set of inequalities that define the convex hull...
On surrogating 0–1 knapsack constraints
On surrogating 0–1 knapsack constraints
1999,
In this note, we present a scheme for tightening 0–1 knapsack constraints based...
Locally Farkas–Minkowski linear inequality systems
Locally Farkas–Minkowski linear inequality systems
1999,
This paper introduces the locally Farkas–Minkowski (LFM) linear inequality...
The stochastic bottleneck linear programming problem
The stochastic bottleneck linear programming problem
1999,
In this paper we consider some stochastic bottleneck linear programming problems. We...
Papers per page: