Data Correcting Approaches in Combinatorial Optimization

Data Correcting Approaches in Combinatorial Optimization 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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Goldengorin, Boris I. (Autor), Pardalos, Panos M. (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York, NY : Springer New York : Imprint: Springer, 2012.
Edición:1st ed. 2012.
Colección:SpringerBriefs in Optimization,
Temas:
Graph theory.
Mathematical optimization.
Artificial intelligence-Data processing.
Algorithms.
Graph Theory.
Optimization.
Data Science.
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-1-4614-5286-7
003 DE-He213
005 20220112191928.0
007 cr nn 008mamaa
008 121026s2012 xxu| s |||| 0|eng d
020 |a 9781461452867  |9 978-1-4614-5286-7 
024 7 |a 10.1007/978-1-4614-5286-7  |2 doi 
050 4 |a QA166-166.247 
072 7 |a PBV  |2 bicssc 
072 7 |a MAT013000  |2 bisacsh 
072 7 |a PBV  |2 thema 
082 0 4 |a 511.5  |2 23 
100 1 |a Goldengorin, Boris I.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Data Correcting Approaches in Combinatorial Optimization  |h [electronic resource] /  |c by Boris I. Goldengorin, Panos M. Pardalos. 
250 |a 1st ed. 2012. 
264 1 |a New York, NY :  |b Springer New York :  |b Imprint: Springer,  |c 2012. 
300 |a X, 114 p. 41 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a SpringerBriefs in Optimization,  |x 2191-575X 
520 |a Data Correcting Approaches in Combinatorial Optimization 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.  Researches, students and engineers will benefit from new bounds and branching rules in development efficient branch-and-bound type computational algorithms. 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. 
650 0 |a Graph theory. 
650 0 |a Mathematical optimization. 
650 0 |a Artificial intelligence-Data processing. 
650 0 |a Algorithms. 
650 1 4 |a Graph Theory. 
650 2 4 |a Optimization. 
650 2 4 |a Data Science. 
650 2 4 |a Algorithms. 
700 1 |a Pardalos, Panos M.  |e author.  |0 (orcid)0000-0003-2824-101X  |1 https://orcid.org/0000-0003-2824-101X  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9781461452874 
776 0 8 |i Printed edition:  |z 9781461452850 
830 0 |a SpringerBriefs in Optimization,  |x 2191-575X 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-1-4614-5286-7  |z Texto Completo 
912 |a ZDB-2-SMA 
912 |a ZDB-2-SXMS 
950 |a Mathematics and Statistics (SpringerNature-11649) 
950 |a Mathematics and Statistics (R0) (SpringerNature-43713) 

Ejemplares similares