Country: Germany

Found 3096 papers in total
A note for ‘On an inventory model for deteriorating items and time-varying demand’
A note for ‘On an inventory model for deteriorating items and time-varying demand’
2001,
In this technical note we discuss a paper of Benkherouf and Balkhi recently published...
Complete, consistent and compatible preference relations
Complete, consistent and compatible preference relations
2001,
Preferences are usually formalized by means of relations. If one takes into account...
Data envelopment analysis from decision theoretical perspective
Data envelopment analysis from decision theoretical perspective
2001,
Analyzing the efficiency of actions or organizational units is a fundamental problem...
Replication invariance on non-transferable utility games
Replication invariance on non-transferable utility games
2000,
Two concepts of replication (conflictual and non-conflictual) are extended from the...
Stability in coalition formation games
Stability in coalition formation games
2000,
In the context of coalition formation games a player evaluates a partition on the...
When are Nash equilibria self-enforcing? An experimental analysis
When are Nash equilibria self-enforcing? An experimental analysis
2000,
We investigate the effect of non-binding pre-play communication in experiments with...
The Owen value values friendship
The Owen value values friendship
2000,
This paper presents two new axiomatizations of the Owen value for games with coalition...
On the optimality of a simple strategy for searching graphs
On the optimality of a simple strategy for searching graphs
2000,
Consider a search game with an immobile hider in a graph. A Chinese postman tour is a...
The comparability of the classical and the Mas–Colell bargaining sets
The comparability of the classical and the Mas–Colell bargaining sets
2000,
The Mas–Colell bargaining set is shown to contain the classical bargaining set...
Stable outcomes of the roommate game with transferable utility
Stable outcomes of the roommate game with transferable utility
2000,
We consider the transferable utility (TU) version of Gale and Shapley's roommate game....
Evolutionarily stable sets
Evolutionarily stable sets
2000,
This paper provides definitions for the evolutionary stability of sets of strategies...
Axiomatizations of the core on the universal domain and other natural domains
Axiomatizations of the core on the universal domain and other natural domains
2000,
We prove that the core on the set of all transferable utility games with players...
On the solitaire cone and its relationship to multi-commodity flows
On the solitaire cone and its relationship to multi-commodity flows
2001,
The classical game of Peg Solitaire has uncertain origins, but was certainly popular...
The core and nucleolus of games: A note on a paper by Göthe-Lundgren et al
The core and nucleolus of games: A note on a paper by Göthe-Lundgren et al
2001,
In the paper ‘On the nucleolus of the basic vehicle routing game’,...
A .699-approximation algorithm for max-bisection
A .699-approximation algorithm for max-bisection
2001,
We present a .699-approximation algorithm for max-bisection, i.e., partitioning the...
Optimization via enumeration: A new algorithm for the max cut problem
Optimization via enumeration: A new algorithm for the max cut problem
2001,
We present a polynomial time algorithm to find the maximum weight of an edge-cut in...
Vertex-disjoint packing of two Steiner trees: Polyhedra and branch-and-cut
Vertex-disjoint packing of two Steiner trees: Polyhedra and branch-and-cut
2001,
Consider the problem of routing the electrical connections among two large terminal...
On sensitivity of central solutions in semidefinite programming
On sensitivity of central solutions in semidefinite programming
2001,
In this paper we study the properties of the analytic central path of a semidefinite...
On the complexity of a class of combinatorial optimization problems with uncertainty
On the complexity of a class of combinatorial optimization problems with uncertainty
2001,
We consider a robust (minmax-regret) version of the problem of selecting p elements of...
A cutting plane algorithm for the general routing problem
A cutting plane algorithm for the general routing problem
2001,
The General Routing Problem (GRP) is the problem of finding a minimum cost route for a...
Variational analysis of non-Lipschitz spectral functions
Variational analysis of non-Lipschitz spectral functions
2001,
We consider spectral functions f o λ, where f is any permutation-invariant...
Combinatorial relaxation algorithm for mixed polynomial matrices
Combinatorial relaxation algorithm for mixed polynomial matrices
2001,
The notion of mixed polynomial matrices is a mathematical tool for faithful...
Concavity cuts for disjoint bilinear programming
Concavity cuts for disjoint bilinear programming
2001,
We pursue the study of concavity cuts for the disjoint bilinear programming problem....
A geometric study of duality gaps, with applications
A geometric study of duality gaps, with applications
2001,
Lagrangian relaxation is often an efficient tool to solve (large-scale) optimization...
Papers per page: