2109 search results - page 162 / 422 » Solving Necklace Constraint Problems |
181
click to vote
COCOA
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
164
click to vote
SSDBM
2003
IEEE
15 years 11 months ago
2003
IEEE
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
129
Voted
EOR
2010
15 years 6 months ago
2010
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportati...
169
click to vote
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
175
click to vote
INFOCOM
2009
IEEE
16 years 27 days ago
2009
IEEE
Continuous monitoring and diagnosis of network performance are of crucial importance for the Internet access service and virtual private network (VPN) service providers. Various o...