840 search results - page 57 / 168 » Inapproximability of Combinatorial Optimization Problems |
110
click to vote
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
127
click to vote
JCO
2011
14 years 3 months ago
2011
This paper presents mathematical programming techniques for solving a class of multi-sensor scheduling problems. Robust optimization problems are formulated for both deterministic ...
107
click to vote
STOC
2005
ACM
16 years 20 days ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
100
Voted
STOC
2004
ACM
16 years 20 days ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
100
click to vote
NHM
2010
14 years 7 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...