840 search results - page 21 / 168 » Inapproximability of Combinatorial Optimization Problems |
PPSN
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
ESA
2006
Springer
14 years 2 months ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
ICNC
2009
Springer
14 years 3 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 ...
WEA
2010
Springer
14 years 5 months ago
2010
Springer
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
ERSA
2006
14 years 9 days ago
2006
: A brief review of mapping generalized template matching operations onto reconfigurable computers is given. A combinatorial optimization process, where the objective is to minimiz...