840 search results - page 68 / 168 » Inapproximability of Combinatorial Optimization Problems |
88
Voted
TALG
2008
15 years 10 days ago
2008
A cost-sharing scheme is a set of rules defining how to share the cost of a service (often computed by solving a combinatorial optimization problem) amongst serviced customers. A ...
122
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
111
Voted
IPCO
1992
15 years 1 months ago
1992
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration...
85
Voted
CPAIOR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract In recent years, the Constraint Programming (CP) and Operations Research (OR) communities have explored the advantages of combining CP and OR techniques to formulate and s...
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
— Achieving the Nash equilibria for single objective games is known to be a computationally difficult problem. However there is a special class of equilibria called evolutionary...