Isbn: 9780898714814 - combinatorial optimization paperback: packing and covering: 74 (cbms-nsf regional conference series in applied mathematics, series number 74) (16 resultados)

Trade Paperback. Condición: Good. No Dust Jacket. First Edition. An ex-library copy in original paper covers, with the usual ex-libris markings. The binding is sound, the text is clean/unmarked, and there is little cover wear. Book.

Condición: New.

Paperback. Condición: New. This monograph presents new and elegant proofs of classical results and makes difficult results accessible.The integer programming models known as set packing and set covering have a wide range of applications. Sometimes, owing to the special structure of the constraint matrix, the natural linear programming relaxation yields an optimal solution that is integral, thus solving the problem. Sometimes, both the linear programming relaxation and its dual have integral optimal solutions. Under which conditions do such integrality conditions hold? This question is of both theoretical and practical interest. Min-max theorems, polyhedral combinatorics, and graph theory all come together in this rich area of discrete mathematics. This monograph presents several of these beautiful results as it introduces mathematicians to this active area of research.To encourage research on the many intriguing open problems that remain, Dr. Cornuéjols is offering a $5000 prize to the first paper solving or refuting each of the 18 conjectures described in the book. To claim one of the prizes mentioned in the preface, papers must be accepted by a quality refereed journal (such as Journal of Combinatorial Theory B, Combinatorica, SIAM Journal on Discrete Mathematics, or others to be determined by Dr. Cornuéjols) before 2020. Claims must be sent to Dr. Cornuéjols at Carnegie Mellon University during his lifetime.…

Condición: new.

Condición: As New. Unread book in perfect condition.

Paperback. Condición: Brand New. 132 pages. 10.00x6.75x0.50 inches. In Stock.

Condición: New. 1987. paperback. . . . . .

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Condición: New.

Condición: New. pp. 144.

Condición: As New. Unread book in perfect condition.

Paperback. Condición: New. New copy - Usually dispatched within 4 working days.

Condición: New. 1987. paperback. . . . . . Books ship from the US and Ireland.

Condición: New. In English.

Paperback. Condición: New. This monograph presents new and elegant proofs of classical results and makes difficult results accessible.The integer programming models known as set packing and set covering have a wide range of applications. Sometimes, owing to the special structure of the constraint matrix, the natural linear programming relaxation yields an optimal solution that is integral, thus solving the problem. Sometimes, both the linear programming relaxation and its dual have integral optimal solutions. Under which conditions do such integrality conditions hold? This question is of both theoretical and practical interest. Min-max theorems, polyhedral combinatorics, and graph theory all come together in this rich area of discrete mathematics. This monograph presents several of these beautiful results as it introduces mathematicians to this active area of research.To encourage research on the many intriguing open problems that remain, Dr. Cornuéjols is offering a $5000 prize to the first paper solving or refuting each of the 18 conjectures described in the book. To claim one of the prizes mentioned in the preface, papers must be accepted by a quality refereed journal (such as Journal of Combinatorial Theory B, Combinatorica, SIAM Journal on Discrete Mathematics, or others to be determined by Dr. Cornuéjols) before 2020. Claims must be sent to Dr. Cornuéjols at Carnegie Mellon University during his lifetime.…

Paperback. Condición: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.