Sciweavers

52 search results - page 11 / 11
» Network design arc set with variable upper bounds
Sort
View
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
13 years 9 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
INFOCOM
2011
IEEE
12 years 8 months ago
BodyT2: Throughput and time delay performance assurance for heterogeneous BSNs
—Body sensor networks (BSNs) have been developed for a set of performance-critical applications, including smart healthcare, assisted living, emergency response, athletic perform...
Zhen Ren, Gang Zhou, Andrew Pyles, Matthew Keally,...