1120 search results - page 19 / 224 » Parallel Algorithmic Techniques for Combinatorial Computatio... |
77
Voted
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor architectures to multicore designs. Continued perform...
87
Voted
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
109
Voted
ICNC
2009
Springer
15 years 2 months ago
2009
Springer
Vehicle routing problem (VRP) is a well-known combinatorial optimization and nonlinear programming problem seeking to service a number of customers with a fleet of vehicles. This ...
116
click to vote
STOC
2012
ACM
13 years 2 days ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
PPSN
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...