Sciweavers

840 search results - page 36 / 168
» Inapproximability of Combinatorial Optimization Problems
Sort
View
EOR
2007
70views more  EOR 2007»
13 years 11 months ago
Solving the maximum edge weight clique problem via unconstrained quadratic programming
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience rep...
Bahram Alidaee, Fred Glover, Gary A. Kochenberger,...
FOCS
2009
IEEE
14 years 5 months ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák
AAAI
2000
14 years 9 days ago
Solving Combinatorial Auctions Using Stochastic Local Search
Combinatorial auctions (CAs) have emerged as an important model in economics and show promise as a useful tool for tackling resource allocation in AI. Unfortunately, winner determ...
Holger H. Hoos, Craig Boutilier
COCOON
2007
Springer
14 years 5 months ago
On the Hardness of Optimization in Power Law Graphs
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks exhibit ...
Alessandro Ferrante, Gopal Pandurangan, Kihong Par...
ICMCS
1999
IEEE
130views Multimedia» more  ICMCS 1999»
14 years 3 months ago
A Combinatorial Approach to Content-Based Music Selection
Advances in networking and transmission of digital multimedia data will bring soon huge catalogues of music to users. Accessing these catalogues raises a problem for users and con...
François Pachet, Pierre Roy, Daniel Cazaly