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...
Sparad:
| Huvudupphovsmän: | , |
|---|---|
| Materialtyp: | Livre numérique |
| Språk: | Anglais |
| Publicerad: |
New York, NY :
Springer New York
2012.
Cham : Springer Nature |
| Serie: | SpringerBriefs in Optimization
|
| Länkar: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmärkning: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Data Correcting Approaches in Combinatorial Optimization, Texte imprimé, 9781461452850 |
| LEADER | 03041nam a22003137a 4500 | ||
|---|---|---|---|
| 001 | 958042 | ||
| 008 | 130325q2000 xx ||| |||| 00| 0 eng d | ||
| 009 | PPN168302594 | ||
| 020 | |a 9781461452867 |z 9781461452867 | ||
| 041 | 0 | |a eng | |
| 082 | |a 511.5 | ||
| 100 | 1 | |a Goldengorin, Boris. | |
| 245 | 1 | 0 | |a Data correcting approaches in combinatorial optimization |c by Boris Goldengorin, Panos M. Pardalos. |
| 260 | |a New York, NY : |b Springer New York. | ||
| 260 | |a Cham : |b Springer Nature, |c 2012. | ||
| 490 | 0 | |a SpringerBriefs in Optimization |x 2190-8354 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 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. | ||
| 700 | 1 | |a Pardalos, Panos M., |d 1954- |4 aut | |
| 776 | 0 | |t Data Correcting Approaches in Combinatorial Optimization |b Texte imprimé |z 9781461452850 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/978-1-4614-5286-7 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-QNZX5MC8-M |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:749585331 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/978-1-4614-5286-7 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:752333801 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/978-1-4614-5286-7 |z Accès INSA CVL | |
| 997 | |0 958042 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||