327 search results - page 47 / 66 » Cutting planes in integer and mixed integer programming |
153
click to vote
WG
2010
Springer
14 years 11 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
100
click to vote
CN
2006
15 years 1 months ago
2006
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
162
click to vote
PLDI
2004
ACM
15 years 6 months ago
2004
ACM
With billion-transistor chips on the horizon, single-chip multiprocessors (CMPs) are likely to become commodity components. Speculative CMPs use hardware to enforce dependence, al...
CPAIOR
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...
117
click to vote
CPAIOR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...