519 search results - page 17 / 104 » A New Approach to Strongly Polynomial Linear Programming |
114
click to vote
CPAIOR
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
105
click to vote
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
113
click to vote
AUTOMATICA
2008
15 years 1 months ago
2008
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
130
click to vote
IPCO
2008
15 years 2 months ago
2008
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
ICCD
2003
IEEE
15 years 10 months ago
2003
IEEE
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...