2976 search results - page 84 / 596 » On the bounded integer programming |
103
Voted
ORL
1998
15 years 5 days 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...
107
click to vote
ENDM
2002
15 years 9 days ago
2002
Given a positive integer n and a family F of graphs, let R(n, F) denote the maximum number of colors in an edge-coloring of Kn such that no subgraph of Kn belonging to F has disti...
97
Voted
JCT
1998
15 years 5 days ago
1998
We show that any k-regular bipartite graph with 2n vertices has at least ((k−1)k−1 kk−2 )n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent...
102
Voted
JCT
2010
14 years 11 months ago
2010
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...
97
Voted
ALT
1998
Springer
15 years 4 months ago
1998
Springer
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...