433 search results - page 1 / 87 » Generalized Ham-Sandwich Cuts |
CCCG
2008
13 years 7 months ago
2008
DCG
2010
13 years 5 months ago
2010
CCCG
1993
13 years 7 months ago
1993
Given disjoint sets P1 P2 : : : Pd in R d with n points in total, a ham-sandwich cut is a hyperplane that simultaneously bisects the Pi. We present algorithms for nding
ORL
2010
13 years 4 months ago
2010
Interval-gradient cuts are (nonlinear) valid inequalities for nonconvex NLPs defined for constraints g(x) ≤ 0 with g being continuously differentiable in a box [x, ¯x]. In th...
RTA
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. We give a simple and direct proof that super-consistency implies cut elimination in deduction modulo. This proof can be seen as a simplification of the proof that super-...