90 search results - page 18 / 18 » Combinatorial Benders' Cuts |
STOC
2009
ACM
14 years 6 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
STOC
2010
ACM
13 years 10 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
AAAI
2006
13 years 7 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
IPL
2010
13 years 4 months ago
2010
In the Max Lin-2 problem we are given a system S of m linear equations in n variables over F2 in which Equation j is assigned a positive integral weight wj for each j. We wish to ...
CORR
2011
Springer
13 years 23 days ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...