23 search results - page 2 / 5 » Exact Algorithms for NP-Hard Problems: A Survey |
INFOCOM
2003
IEEE
13 years 10 months ago
2003
IEEE
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
HEURISTICS
2010
13 years 2 months ago
2010
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
EOR
2002
13 years 4 months ago
2002
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
SIGMOD
2011
ACM
12 years 7 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...