Cargando…
Discrete optimization /
This book treats the fundamental issues and algorithmic strategies emerging as the core of the discipline of discrete optimization in a comprehensive and rigorous fashion. Following an introductory chapter on computational complexity, the basic algorithmic results for the two major models of polynom...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Otros Autores: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Boston :
Academic Press,
�1988.
|
| Colección: | Computer science and scientific computing.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | SCIDIR_ocn577286233 | ||
| 003 | OCoLC | ||
| 005 | 20231117033012.0 | ||
| 006 | m o d | ||
| 007 | cr bn||||||abp | ||
| 007 | cr bn||||||ada | ||
| 008 | 100326s1988 maua ob 001 0 eng d | ||
| 040 | |a OCLCE |b eng |e pn |c OCLCE |d OCLCQ |d OCLCF |d OPELS |d N$T |d E7B |d YDXCP |d DEBSZ |d OCLCQ |d LUN |d SFB |d OCLCQ |d SFB |d OCLCO |d UKAHL |d VLY |d INARC |d OCL |d OCLCO |d OCLCQ |d OCL |d OCLCO | ||
| 019 | |a 301226594 |a 1100876104 |a 1285557056 | ||
| 020 | |a 0125450753 |q (electronic bk.) | ||
| 020 | |a 9780125450751 |q (electronic bk.) | ||
| 020 | |a 9781483294803 |q (electronic bk.) | ||
| 020 | |a 1483294803 |q (electronic bk.) | ||
| 035 | |a (OCoLC)577286233 |z (OCoLC)301226594 |z (OCoLC)1100876104 |z (OCoLC)1285557056 | ||
| 042 | |a dlr | ||
| 050 | 4 | |a QA402.5 |b .P39 1988 | |
| 072 | 7 | |a MAT |x 000000 |2 bisacsh | |
| 082 | 0 | 4 | |a 511/.6 |2 19 |
| 084 | |a 31.12 |2 bcl | ||
| 084 | |a 31.80 |2 bcl | ||
| 084 | |a 54.59 |2 bcl | ||
| 084 | |a *90C10 |2 msc | ||
| 084 | |a 05B35 |2 msc | ||
| 084 | |a 68Q25 |2 msc | ||
| 084 | |a 68Rxx |2 msc | ||
| 084 | |a 90-01 |2 msc | ||
| 084 | |a 90C05 |2 msc | ||
| 084 | |a 90C11 |2 msc | ||
| 084 | |a 90C27 |2 msc | ||
| 084 | |a SK 890 |2 rvk | ||
| 084 | |a SK 870 |2 rvk | ||
| 100 | 1 | |a Parker, R. Gary. | |
| 245 | 1 | 0 | |a Discrete optimization / |c R. Gary Parker, Ronald L. Rardin. |
| 260 | |a Boston : |b Academic Press, |c �1988. | ||
| 300 | |a 1 online resource (xi, 472 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Computer science and scientific computing | |
| 504 | |a Includes bibliographical references (pages 437-459) and index. | ||
| 506 | |3 Use copy |f Restrictions unspecified |2 star |5 MiAaHDL | ||
| 533 | |a Electronic reproduction. |b [Place of publication not identified] : |c HathiTrust Digital Library, |d 2010. |5 MiAaHDL | ||
| 538 | |a Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. |u http://purl.oclc.org/DLF/benchrepro0212 |5 MiAaHDL | ||
| 583 | 1 | |a digitized |c 2010 |h HathiTrust Digital Library |l committed to preserve |2 pda |5 MiAaHDL | |
| 588 | 0 | |a Print version record. | |
| 520 | |a This book treats the fundamental issues and algorithmic strategies emerging as the core of the discipline of discrete optimization in a comprehensive and rigorous fashion. Following an introductory chapter on computational complexity, the basic algorithmic results for the two major models of polynomial algorithms are introduced--models using matroids and linear programming. Further chapters treat the major non-polynomial algorithms: branch-and-bound and cutting planes. The text concludes with a chapter on heuristic algorithms. | ||
| 505 | 0 | |a Machine derived contents note: Table of contents for Discrete optimization / R. Gary Parker, Ronald L. Rardin. -- Bibliographic record and links to related information available from the Library of Congress catalog -- Information from electronic data provided by the publisher. May be incomplete or contain other coding. -- Introduction to Discrete Optimization. Computational Complexity. Polynomial Algorithms-Matroids Enumeration Algorithms. Polynomial Algorithms. Linear Programming Nonpolynomial algorithims-Partial Enumeration Nonpolynomial Algorithims-Polyhedral Description Nonexact Algorithms Vector Matrices and Convex Sets Graph Theory Fundamentals Linear Programming Fundamentals. -- Library of Congress subject headings for this publication: Mathematical optimization. | |
| 650 | 0 | |a Mathematical optimization. | |
| 650 | 0 | |a Electronic books. | |
| 650 | 6 | |a Optimisation math�ematique. |0 (CaQQLa)201-0007680 | |
| 650 | 6 | |a Livres num�eriques. |0 (CaQQLa)201-0160798 | |
| 650 | 7 | |a e-books. |2 aat |0 (CStmoGRI)aat300265554 | |
| 650 | 7 | |a MATHEMATICS |x General. |2 bisacsh | |
| 650 | 7 | |a Mathematical optimization |2 fast |0 (OCoLC)fst01012099 | |
| 650 | 1 | 7 | |a Optimaliseren. |2 gtt |
| 650 | 1 | 7 | |a Combinatieleer. |2 gtt |
| 653 | |a Combinatorial mathematics | ||
| 700 | 1 | |a Rardin, Ronald L. | |
| 776 | 0 | 8 | |i Print version: |a Parker, R. Gary. |t Discrete optimization. |d Boston : Academic Press, �1988 |w (DLC) 87001076 |w (OCoLC)15280859 |
| 830 | 0 | |a Computer science and scientific computing. | |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/book/9780125450751 |z Texto completo |