350 search results - page 3 / 70 » Separation of Partition Inequalities |
MP
2006
13 years 7 months ago
2006
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
ORL
1998
13 years 6 months ago
1998
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
MP
2006
13 years 7 months ago
2006
This paper addresses a multi-stage stochastic integer programming formulation of the uncapacitated lot-sizing problem under uncertainty. We show that the classical ( , S) inequalit...
SIGIR
2008
ACM
13 years 7 months ago
2008
ACM
Web pages, like people, are often known by others in a variety of contexts. When those contexts are sufficiently distinct, a page's importance may be better represented by mu...
IPCO
2004
13 years 8 months ago
2004
