:: eBooks :: Kembali

eBooks :: Kembali

Data correcting approaches in combinatorial optimization

edited by Boris Goldengorin, Panos M. Pardalos (Springer, 2012)

 Abstrak

This book focuses on algorithmic applications of the well known polynomially solvable special cases of computationally intractable problems. The purpose of this text is to design practically efficient algorithms for solving wide classes of combinatorial optimization problems. This book examines applications for solving the traveling salesman problem and its variations, maximum weight independent set problem, different classes of allocation and cluster analysis as well as some classes of scheduling problems. Data correcting algorithms in combinatorial optimization introduces the data correcting approach to algorithms which provide an answer to the following questions, how to construct a bound to the original intractable problem and find which element of the corrected instance one should branch such that the total size of search tree will be minimized. The PC time needed for solving intractable problems will be adjusted with the requirements for solving real world problems.​

 File Digital: 1

Shelf
 Data Correcting Approaches in Combinatorial Optimization.pdf :: Unduh

LOGIN required

 Metadata

No. Panggil : e20420331
Entri tambahan-Nama orang :
Subjek :
Penerbitan : New York: Springer, 2012
Sumber Pengatalogan: LibUI eng rda
Tipe Konten: text
Tipe Media: computer
Tipe Pembawa: online resource
Deskripsi Fisik:
Tautan: http://link.springer.com/book/10.1007%2F978-1-4614-5286-7
Lembaga Pemilik:
Lokasi:
  • Ketersediaan
  • Ulasan
No. Panggil No. Barkod Ketersediaan
e20420331 20-21-034714596 TERSEDIA
Ulasan:
Tidak ada ulasan pada koleksi ini: 20420331