Titlebook: Combinatorial Optimization; Theory and Algorithm Bernhard Korte,Jens Vygen Textbook 20022nd edition Springer-Verlag Berlin Heidelberg 2002

鑲嵌細(xì)工

連鎖

Weighted Matching,Nonbipartite weighted matching appears to be one of the “hardest” combinatorial optimization problems that can be solved in polynomial time. We shall extend . to the weighted case and shall again obtain an .(..)-implementation. This algorithm has many applications, some of which are mentioned in the exercises and in Section 12.2.

Angiogenesis

爭(zhēng)吵加

我沒(méi)有命令

The Knapsack Problem,The . and the . discussed in earlier chapters are among the “hardest” problems for which a polynomial-time algorithm is known. In this chapter we deal with the following problem which turns out to be, in a sense, the “easiest” .-hard problem

Credence

Bin-Packing,Suppose we have . objects, each of a given size, and some bins of equal capacity. We want to assign the objects to the bins, using as few bins as possible. Of course the total size of the objects assigned to one bin should not exceed its capacity.

命令變成大炮

Bricklayer

PHAG

,-Completeness,are also many important problems for which no polynomial-time algorithm is known. Although we cannot prove that none exists we can show that a polynomial-time algorithm for one “hard” (more precisely: .-hard) problem would imply a polynomial-time algorithm for almost all problems discussed in this book (more precisely: all .-easy problems).

ovation