Country: Germany

Found 3096 papers in total
The domino inequalities: facets for the symmetric travelling salesman polytope
The domino inequalities: facets for the symmetric travelling salesman polytope
2003,
Adam Letchford has defined the Domino Parity inequalities for the Symmetric Traveling...
An optimal service rate in a Poisson arrival queue with two-stage service policy
An optimal service rate in a Poisson arrival queue with two-stage service policy
2003,
We consider a two-stage service policy for a Poisson arrival queueing system. The idle...
The unbalance and bounds on the average waiting time for periodic routing to one queue
The unbalance and bounds on the average waiting time for periodic routing to one queue
2004,
In this paper we introduce the combinatorial notion of unbalance for a periodic...
Optimal lower bounds on the contribution margin in the case of stochastic order arrival
Optimal lower bounds on the contribution margin in the case of stochastic order arrival
2003,
In customer order driven production, decisions on the acceptance of customer orders...
Two exact algorithms for the capacitated p-median problem
Two exact algorithms for the capacitated p-median problem
2003,
The p-median problem has been widely studied in combinatorial optimisation, but its...
Robust facility location
Robust facility location
2003,
Let A be a nonempty finite subset of the plane representing the geographical...
A note on the complexity of determining optimal strategies in games with common payoffs
A note on the complexity of determining optimal strategies in games with common payoffs
2003,
In a recent paper, Chu and Halpern investigated the problem of finding optimal...
Neighbor games and the leximax solution
Neighbor games and the leximax solution
2003,
Neighbor games arise from certain matching or sequencing situations in which only some...
On the properties of solutions for non-transferable utility communication situations
On the properties of solutions for non-transferable utility communication situations
2003,
We consider the model of cooperative games in which the agents can restrict the...
Closedness under reduced games
Closedness under reduced games
2003,
We will introduce the notation of the generalized reduced game to “unify”...
On Pareto equilibria in vector-valued extensive form games
On Pareto equilibria in vector-valued extensive form games
2003,
In this paper we investigate the existence of Pareto equilibria in vector-valued...
Stochastic games with non-observable actions
Stochastic games with non-observable actions
2003,
We examine n -player stochastic games. These are dynamic games where a play evolves in...
An axiomatization of the Banzhaf value for cooperative games on antimatroids
An axiomatization of the Banzhaf value for cooperative games on antimatroids
2004,
Cooperative games on antimatroids are cooperative games in which coalition formation...
Strategic capital budgeting: assett replacement under market uncertainty
Strategic capital budgeting: assett replacement under market uncertainty
2003,
In this paper the impact of product market uncertainty on the optimal replacement...
Upper bounds on the independence and the clique covering number
Upper bounds on the independence and the clique covering number
2003,
New upper bounds for the independence number and for the clique covering number of a...
Chemical trees enumeration algorithms
Chemical trees enumeration algorithms
2003,
In the chemical community the need for representing chemical structures within a given...
Bottleneck shortest paths on a partially ordered scale
Bottleneck shortest paths on a partially ordered scale
2003,
In bottleneck combinatorial problems, admissible solutions are compared with respect...
Lift-and-project cuts and perfect graphs
Lift-and-project cuts and perfect graphs
2003,
We analyze the application of lift-and-project to the clique relaxation of the stable...
Extending the Balas–Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices
Extending the Balas–Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices
2003,
A result of Balas and Yu states that the number of maximal independent sets of a graph...
The clustering matroid and the optimal clustering tree
The clustering matroid and the optimal clustering tree
2003,
We consider the following problem: Given a complete graph G = ( V, E ) with a...
Characterizing matchings as the intersection of matroids
Characterizing matchings as the intersection of matroids
2003,
This paper deals with the problem of representing the matching independent system in a...
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
2004,
We deal with non-rank facets of the stable set polytope of claw-free graphs. We extend...
Cost benefit analysis of series systems with warm standby components
Cost benefit analysis of series systems with warm standby components
2003,
This paper deals with the cost benefit analysis of series systems with warm standby...
One-armed bandit models with continuous and delayed processes
One-armed bandit models with continuous and delayed processes
2003,
One-armed bandit processes with continuous delayed responses are formulated as...
Papers per page: