840 search results - page 34 / 168 » Inapproximability of Combinatorial Optimization Problems |
EOR
2006
13 years 11 months ago
2006
Many important problems arising in computational biochemistry and genomics have been formulated in terms of underlying combinatorial optimization models. In particular, a number h...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
This paper proposes a reweighted least squares algorithm for quadrature amplitude modulation (QAM) detector in multiple-input multiple-output (MIMO) channels. Although the QAM det...
SIGECOM
2000
ACM
14 years 3 months ago
2000
ACM
Supply chain formation presents difficult coordination issues for distributed negotiation protocols. Agents must simultaneously negotiate production relationships at multiple lev...
ICMAS
2000
14 years 9 days ago
2000
Combinatorial auctions are important as they enable bidders to place bids on combinations of items; compared to other auction mechanisms, they often increase the efficiency of the...
AAIM
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...