Sciweavers

7 search results - page 2 / 2
» disopt 2011
Sort
View
DISOPT
2011
175views Education» more  DISOPT 2011»
12 years 8 months ago
Strengthening lattice-free cuts using non-negativity
In recent years there has been growing interest in generating valid inequalities for mixedinteger programs using sets with 2 or more constraints. In particular, Andersen et al. (2...
Ricardo Fukasawa, Oktay Günlük
DISOPT
2011
240views Education» more  DISOPT 2011»
12 years 11 months ago
On the directed Full Degree Spanning Tree problem
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...