:: eBooks :: Kembali

eBooks :: Kembali

Combinatorial optimization: packing and covering

Gerard Cornuejols (Society for Industrial and Applied Mathematics, 2001)

 Abstrak

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.

 File Digital: 1

Shelf
 Combinatorial optimization packing and covering.pdf :: Unduh

LOGIN required

 Metadata

No. Panggil : e20449115
Entri utama-Nama orang :
Subjek :
Penerbitan : Philadelphia: Society for Industrial and Applied Mathematics, 2001
Sumber Pengatalogan: LibUI eng rda
Tipe Konten: text
Tipe Media: computer
Tipe Pembawa: online resource
Deskripsi Fisik: xi, 132 pages : illustration
Tautan: http://portal.igpublish.com/iglibrary/search/SIAMB0000325.main.html?7
Lembaga Pemilik:
Lokasi:
  • Ketersediaan
  • Ulasan
No. Panggil No. Barkod Ketersediaan
e20449115 02-17-247286564 TERSEDIA
Ulasan:
Tidak ada ulasan pada koleksi ini: 20449115