Sciweavers

906 search results - page 1 / 182
» Chain Dominated Orders
Sort
View
ORDER
2006
97views more  ORDER 2006»
13 years 4 months ago
Chain Dominated Orders
We study finite partial orders which have a chain such that every element of the order either belongs to this chain or has all its covers in this chain. We show that such orders a...
Glen-Brug Guenver, Jimmy Leblet, Jean-Xavier Rampo...
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 4 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
ECIS
2003
13 years 6 months ago
An analysis of the impact of reputation on supply webs
In long-term, recurring contractual relationships, which are common in the B2B-area, reputation and trust play an outstanding role. The impact of reputation and price-based assess...
Jochen Franke, Tim Stockheim
DM
2008
103views more  DM 2008»
13 years 4 months ago
A note on lattice chains and Delannoy numbers
Fix nonnegative integers n1, . . . , nd and let L denote the lattice of integer points (a1, . . . , ad) Zd satisfying 0 ai ni for 1 i d. Let L be partially ordered by the usua...
John S. Caughman IV, Clifford R. Haithcock, J. J. ...
MP
2008
137views more  MP 2008»
13 years 4 months ago
Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints
Stochastic dominance relations are well-studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into...
Nilay Noyan, Andrzej Ruszczynski