1215 search results - page 130 / 243 » Combinatorics |
120
Voted
COMBINATORICS
1999
15 years 3 months ago
1999
A symmetric group action on the maximal chains in a finite, ranked poset is local if the adjacent transpositions act in such a way that (i, i + 1) sends each maximal chain either ...
79
Voted
COMBINATORICS
1999
15 years 3 months ago
1999
In 1964, Ronald Graham proved that there exist relatively prime natural numbers a and b such that the sequence {An} defined by An = An-1 + An-2 (n 2; A0 = a, A1 = b) contains no ...
128
click to vote
COCOON
2009
Springer
15 years 10 months ago
2009
Springer
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...
130
click to vote
CCO
2001
Springer
15 years 8 months ago
2001
Springer
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
317
click to vote
CCO
2001
Springer
15 years 8 months ago
2001
Springer
In this paper we survey the basic features of state-of-the-art branch-and-cut algorithms for the solution of general mixed integer programming problems. In particular we focus on p...