Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt
| Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt |
| Autore | Mesbahi Mehran |
| Edizione | [STU student edition] |
| Pubbl/distr/stampa | Princeton : , : Princeton University Press, , [2010] |
| Descrizione fisica | 1 online resource (424 pages) |
| Disciplina | 006.3 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico |
Network analysis (Planning) - Graphic methods
Multiagent systems - Mathematical models |
| Soggetto non controllato |
Addition
Adjacency matrix Algebraic graph theory Algorithm Automorphism Bipartite graph Cardinality Cartesian product Circulant graph Combinatorics Complete graph Computation Connectivity (graph theory) Controllability Convex combination Corollary Cycle graph (algebra) Cycle space Degree (graph theory) Degree matrix Diagonal matrix Diameter Differentiable function Dimension Directed graph Division by zero Dynamical system Eigenvalues and eigenvectors Equilibrium point Estimation Estimator Existential quantification Extremal graph theory Graph (discrete mathematics) Graph theory Identity matrix Incidence matrix Information exchange Initial condition Interconnection Iteration Kalman filter Kronecker product LTI system theory LaSalle's invariance principle Laplacian matrix Least squares Line graph Linear map Lipschitz continuity Lyapunov function Lyapunov stability Markov chain Mathematical optimization Matrix exponential Measurement Multi-agent system Nash equilibrium Natural number Network topology Nonnegative matrix Notation Observability Optimal control Optimization problem Pairwise Parameter Path graph Permutation matrix Permutation Positive semidefinite Positive-definite matrix Probability Quantity Random graph Random variable Rate of convergence Requirement Result Robotics Scientific notation Sensor Sign (mathematics) Simplicial complex Special case Spectral graph theory Stochastic matrix Strongly connected component Subset Summation Supergraph Symmetric matrix Systems theory Theorem Theory Unit interval Upper and lower bounds Variable (mathematics) Vector space Without loss of generality |
| ISBN |
9781400835355 (electronic book)
1-282-97910-8 9786612979101 1-4008-3535-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Notation -- PART 1. FOUNDATIONS -- Chapter 1. Introduction -- Chapter 2. Graph Theory -- Chapter 3. The Agreement Protocol: Part I-The Static Case -- Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- Chapter 5. Probabilistic Analysis of Networks and Protocols -- PART 2. MULTIAGENT NETWORKS -- Chapter 6. Formation Control -- Chapter 7. Mobile Robots -- Chapter 8. Distributed Estimation -- Chapter 9. Social Networks, Epidemics, and Games -- PART 3. NETWORKS AS SYSTEMS -- Chapter 10. Agreement with Inputs and Outputs -- Chapter 11. Synthesis of Networks -- Chapter 12. Dynamic Graph Processes -- Chapter 13. Higher-order Networks -- Appendix A. -- Bibliography -- Index |
| Record Nr. | UNINA-9910785659103321 |
Mesbahi Mehran
|
||
| Princeton : , : Princeton University Press, , [2010] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt
| Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt |
| Autore | Mesbahi Mehran |
| Edizione | [STU student edition] |
| Pubbl/distr/stampa | Princeton : , : Princeton University Press, , [2010] |
| Descrizione fisica | 1 online resource (424 pages) |
| Disciplina | 006.3 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico |
Network analysis (Planning) - Graphic methods
Multiagent systems - Mathematical models |
| Soggetto non controllato |
Addition
Adjacency matrix Algebraic graph theory Algorithm Automorphism Bipartite graph Cardinality Cartesian product Circulant graph Combinatorics Complete graph Computation Connectivity (graph theory) Controllability Convex combination Corollary Cycle graph (algebra) Cycle space Degree (graph theory) Degree matrix Diagonal matrix Diameter Differentiable function Dimension Directed graph Division by zero Dynamical system Eigenvalues and eigenvectors Equilibrium point Estimation Estimator Existential quantification Extremal graph theory Graph (discrete mathematics) Graph theory Identity matrix Incidence matrix Information exchange Initial condition Interconnection Iteration Kalman filter Kronecker product LTI system theory LaSalle's invariance principle Laplacian matrix Least squares Line graph Linear map Lipschitz continuity Lyapunov function Lyapunov stability Markov chain Mathematical optimization Matrix exponential Measurement Multi-agent system Nash equilibrium Natural number Network topology Nonnegative matrix Notation Observability Optimal control Optimization problem Pairwise Parameter Path graph Permutation matrix Permutation Positive semidefinite Positive-definite matrix Probability Quantity Random graph Random variable Rate of convergence Requirement Result Robotics Scientific notation Sensor Sign (mathematics) Simplicial complex Special case Spectral graph theory Stochastic matrix Strongly connected component Subset Summation Supergraph Symmetric matrix Systems theory Theorem Theory Unit interval Upper and lower bounds Variable (mathematics) Vector space Without loss of generality |
| ISBN |
9781400835355 (electronic book)
1-282-97910-8 9786612979101 1-4008-3535-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Notation -- PART 1. FOUNDATIONS -- Chapter 1. Introduction -- Chapter 2. Graph Theory -- Chapter 3. The Agreement Protocol: Part I-The Static Case -- Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- Chapter 5. Probabilistic Analysis of Networks and Protocols -- PART 2. MULTIAGENT NETWORKS -- Chapter 6. Formation Control -- Chapter 7. Mobile Robots -- Chapter 8. Distributed Estimation -- Chapter 9. Social Networks, Epidemics, and Games -- PART 3. NETWORKS AS SYSTEMS -- Chapter 10. Agreement with Inputs and Outputs -- Chapter 11. Synthesis of Networks -- Chapter 12. Dynamic Graph Processes -- Chapter 13. Higher-order Networks -- Appendix A. -- Bibliography -- Index |
| Record Nr. | UNINA-9910816716403321 |
|
Mesbahi Mehran
|
||
| Princeton : , : Princeton University Press, , [2010] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Lectures on Curves on an Algebraic Surface. (AM-59), Volume 59 / / David Mumford
| Lectures on Curves on an Algebraic Surface. (AM-59), Volume 59 / / David Mumford |
| Autore | Mumford David |
| Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
| Descrizione fisica | 1 online resource (221 pages) |
| Disciplina | 516.5 |
| Collana | Annals of Mathematics Studies |
| Soggetto topico |
Curves, Algebraic
Surfaces, Algebraic |
| Soggetto non controllato |
Affine space
Algebraic geometry Algebraic topology Algebraically closed field Binary operation Chern class Coherent sheaf Cohomology Complex vector bundle Dense set Differential form Direct product Family of curves Formal power series Functor Generic point Group ring Homomorphism Invertible sheaf Local ring Morphism of schemes Morphism Nonlinear system Open set Pairwise Polynomial Power series Projective space Rational function Rational point Sheaf (mathematics) Subring Summation Symmetric function Topology Union (set theory) Zariski topology Zero divisor |
| ISBN | 1-4008-8206-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- INTRODUCTION -- CONTENTS -- LECTURE 1. RAW MATERIAL ON CURVES ON SURFACES, AND THE PROBLEMS SUGGESTED -- LECTURE 2. THE FUNDAMENTAL EXISTENCE PROBLEM AND TWO ANALYTIC PROOFS -- LECTURE 3. PRE-SCHEMES AND THEIR ASSOCIATED "FUNCTOR OF POINTS" -- LECTURE 4. USES OF THE FUNCTOR OF POINTS -- APPENDIX TO LECTURE 4. RE REPRESENTABLE FUNCTORS AND ZARISKI TANGENT SPACES -- LECTURE 5. Pro j AND INVERTIBLE SHEAVES -- APPENDIX TO LECTURE 5 -- LECTURE 6. PROPERTIES OP MORPHISMS AND SHEAVES -- LECTURE 7. RESUME OF THE COHOMOLOGY OF COHERENT SHEAVES ON Pn -- LECTURE 8. FLATTENING STRATIFICATIONS -- LECTURE 9. CARTIER DIVISORS -- LECTURE 10. FUNCTORIAL PROPERTIES OF EFFECTIVE CARTIER DIVISORS -- LECTURE 11. BACK TO THE CLASSICAL CASE -- LECTURE 12. THE OVER-ALL CLASSIFICATION OF CURVES ON SURFACES -- LECTURE 13. LINEAR SYSTEMS AND EXAMPLES -- LECTURE 14. SOME VANISHING THEOREMS -- LECTURE 15. UNIVERSAL FAMILIES OF CURVES -- LECTURE 16. THE METHOD OF CHOW SCHEMES -- LECTURE 17. GOOD CURVES -- LECTURE 18. THE INDEX THEOREM -- LECTURE 19. THE PICARD SCHEME : OUTLINE -- LECTURE 20. INDEPENDENT 0-CYCLES ON A SURFACE -- LECTURE 21. THE PICARD SCHEME: CONCLUSION -- LECTURE 22. THE CHARACTERISTIC MAP OP A FAMILY OP CURVES -- LECTURE 23. THE FUNDAMENTAL THEOREM VIA KODAIRA-SPENCER -- LECTURE 24. THE STRUCTURE OF Φ -- LECTURE 25. THE FUNDAMENTAL THEOREM VIA GROTHENDIECK-CARTIER -- LECTURE 26. RING SCHEMES; THE WITT SCHEME -- APPENDICES TO LECTURE 26 APPENDICES TO LECTURE 26 -- LECTURE 27. THE FUNDAMENTAL THEOREM IN CHARACTERISTIC p -- WORKS REFERRED TO -- Backmatter |
| Record Nr. | UNINA-9910154747503321 |
|
Mumford David
|
||
| Princeton, NJ : , : Princeton University Press, , [2016] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Lectures on resolution of singularities [[electronic resource] /] / János Kollár
| Lectures on resolution of singularities [[electronic resource] /] / János Kollár |
| Autore | Kollár János |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, N.J., : Princeton University Press, 2007 |
| Descrizione fisica | 1 online resource (215 p.) |
| Disciplina | 516.3/5 |
| Collana | Annals of mathematics studies |
| Soggetto topico | Singularities (Mathematics) |
| Soggetto non controllato |
Adjunction formula
Algebraic closure Algebraic geometry Algebraic space Algebraic surface Algebraic variety Approximation Asymptotic analysis Automorphism Bernhard Riemann Big O notation Birational geometry C0 Canonical singularity Codimension Cohomology Commutative algebra Complex analysis Complex manifold Computability Continuous function Coordinate system Diagram (category theory) Differential geometry of surfaces Dimension Divisor Du Val singularity Dual graph Embedding Equation Equivalence relation Euclidean algorithm Factorization Functor General position Generic point Geometric genus Geometry Hyperplane Hypersurface Integral domain Intersection (set theory) Intersection number (graph theory) Intersection theory Irreducible component Isolated singularity Laurent series Line bundle Linear space (geometry) Linear subspace Mathematical induction Mathematics Maximal ideal Morphism Newton polygon Noetherian ring Noetherian Open problem Open set P-adic number Pairwise Parametric equation Partial derivative Plane curve Polynomial Power series Principal ideal Principalization (algebra) Projective space Projective variety Proper morphism Puiseux series Quasi-projective variety Rational function Regular local ring Resolution of singularities Riemann surface Ring theory Ruler Scientific notation Sheaf (mathematics) Singularity theory Smooth morphism Smoothness Special case Subring Summation Surjective function Tangent cone Tangent space Tangent Taylor series Theorem Topology Toric variety Transversal (geometry) Variable (mathematics) Weierstrass preparation theorem Weierstrass theorem Zero set |
| ISBN |
1-282-15774-4
9786612157745 1-4008-2780-9 |
| Classificazione | SK 240 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Introduction -- Chapter 1. Resolution for Curves -- Chapter 2. Resolution for Surfaces -- Chapter 3. Strong Resolution in Characteristic Zero -- Bibliography -- Index |
| Record Nr. | UNINA-9910778222903321 |
|
Kollár János
|
||
| Princeton, N.J., : Princeton University Press, 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Robust optimization [[electronic resource] /] / Aharon Ben-Tal, Laurent El Ghaoui, Arkadi Nemirovski
| Robust optimization [[electronic resource] /] / Aharon Ben-Tal, Laurent El Ghaoui, Arkadi Nemirovski |
| Autore | Ben-Tal A |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, NJ, : Princeton University Press, c2009 |
| Descrizione fisica | 1 online resource (565 p.) |
| Disciplina | 519.6 |
| Altri autori (Persone) |
El GhaouiLaurent
NemirovskiĭArkadiĭ Semenovich |
| Collana | Princeton Series in Applied Mathematics |
| Soggetto topico |
Robust optimization
Linear programming |
| Soggetto non controllato |
0O
Accuracy and precision Additive model Almost surely Approximation algorithm Approximation Best, worst and average case Bifurcation theory Big O notation Candidate solution Central limit theorem Chaos theory Coefficient Computational complexity theory Constrained optimization Convex hull Convex optimization Convex set Cumulative distribution function Curse of dimensionality Decision problem Decision rule Degeneracy (mathematics) Diagram (category theory) Duality (optimization) Dynamic programming Exponential function Feasible region Floor and ceiling functions For All Practical Purposes Free product Ideal solution Identity matrix Inequality (mathematics) Infimum and supremum Integer programming Law of large numbers Likelihood-ratio test Linear dynamical system Linear inequality Linear map Linear matrix inequality Linear programming Linear regression Loss function Margin classifier Markov chain Markov decision process Mathematical optimization Max-plus algebra Maxima and minima Multivariate normal distribution NP-hardness Norm (mathematics) Normal distribution Optimal control Optimization problem Orientability P versus NP problem Pairwise Parameter Parametric family Probability distribution Probability Proportionality (mathematics) Quantity Random variable Relative interior Robust control Robust decision-making Robust optimization Semi-infinite Sensitivity analysis Simple set Singular value Skew-symmetric matrix Slack variable Special case Spherical model Spline (mathematics) State variable Stochastic calculus Stochastic control Stochastic optimization Stochastic programming Stochastic Strong duality Support vector machine Theorem Time complexity Uncertainty Uniform distribution (discrete) Unimodality Upper and lower bounds Variable (mathematics) Virtual displacement Weak duality Wiener filter With high probability Without loss of generality |
| ISBN |
1-282-25928-8
9786612259289 1-4008-3105-9 |
| Classificazione | SK 870 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Preface -- Part I. Robust Linear Optimization -- Chapter One. Uncertain Linear Optimization Problems and their Robust Counterparts -- Chapter Two. Robust Counterpart Approximations of Scalar Chance Constraints -- Chapter Three. Globalized Robust Counterparts of Uncertain LO Problems -- Chapter Four. More on Safe Tractable Approximations of Scalar Chance Constraints -- Part II. Robust Conic Optimization -- Chapter Five. Uncertain Conic Optimization: The Concepts -- Chapter Six. Uncertain Conic Quadratic Problems with Tractable RCs -- Chapter Seven. Approximating RCs of Uncertain Conic Quadratic Problems -- Chapter Eight. Uncertain Semidefinite Problems with Tractable RCs -- Chapter Nine. Approximating RCs of Uncertain Semidefinite Problems -- Chapter Ten. Approximating Chance Constrained CQIs and LMIs -- Chapter Eleven. Globalized Robust Counterparts of Uncertain Conic Problems -- Chapter Twelve. Robust Classi¯cation and Estimation -- Part III. Robust Multi-Stage Optimization -- Chapter Thirteen. Robust Markov Decision Processes -- Chapter Fourteen. Robust Adjustable Multistage Optimization -- Part IV. Selected Applications -- Chapter Fifteen. Selected Applications -- Appendix A: Notation and Prerequisites -- Appendix B: Some Auxiliary Proofs -- Appendix C: Solutions to Selected Exercises -- Bibliography -- Index |
| Record Nr. | UNINA-9910778219003321 |
|
Ben-Tal A
|
||
| Princeton, NJ, : Princeton University Press, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Temperley-Lieb Recoupling Theory and Invariants of 3-Manifolds (AM-134), Volume 134 / / Louis H. Kauffman, Sostenes Lins
| Temperley-Lieb Recoupling Theory and Invariants of 3-Manifolds (AM-134), Volume 134 / / Louis H. Kauffman, Sostenes Lins |
| Autore | Kauffman Louis H. |
| Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
| Descrizione fisica | 1 online resource (308 pages) : illustrations |
| Disciplina | 514/.224 |
| Collana | Annals of Mathematics Studies |
| Soggetto topico |
Knot theory
Three-manifolds (Topology) Invariants |
| Soggetto non controllato |
3-manifold
Addition Algorithm Ambient isotopy Axiom Backslash Barycentric subdivision Bijection Bipartite graph Borromean rings Boundary parallel Bracket polynomial Calculation Canonical form Cartesian product Cobordism Coefficient Combination Commutator Complex conjugate Computation Connected component (graph theory) Connected sum Cubic graph Diagram (category theory) Dimension Disjoint sets Disjoint union Elaboration Embedding Equation Equivalence class Explicit formula Explicit formulae (L-function) Factorial Fundamental group Graph (discrete mathematics) Graph embedding Handlebody Homeomorphism Homology (mathematics) Identity element Intersection form (4-manifold) Inverse function Jones polynomial Kirby calculus Knot theory Line segment Linear independence Matching (graph theory) Mathematical physics Mathematical proof Mathematics Maxima and minima Monograph Natural number Network theory Notation Numerical analysis Orientability Orthogonality Pairing Pairwise Parametrization Parity (mathematics) Partition function (mathematics) Permutation Poincaré conjecture Polyhedron Quantum group Quantum invariant Recoupling Recursion Reidemeister move Result Roger Penrose Root of unity Scientific notation Sequence Significant figures Simultaneous equations Smoothing Special case Sphere Spin network Summation Symmetric group Tetrahedron The Geometry Center Theorem Theory Three-dimensional space (mathematics) Time complexity Tubular neighborhood Two-dimensional space Vector field Vector space Vertex (graph theory) Winding number Writhe |
| ISBN | 1-4008-8253-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Chapter 1. Introduction -- Chapter 2. Bracket Polynomial, Temperley-Lieb Algebra -- Chapter 3. Jones-Wenzl Projectors -- Chapter 4. The 3-Vertex -- Chapter 5. Properties of Projectors and 3-Vertices -- Chapter 6. θ-Evaluations -- Chapter 7. Recoupling Theory Via Temperley-Lieb Algebra -- Chapter 8. Chromatic Evaluations and the Tetrahedron -- Chapter 9. A Summary of Recoupling Theory -- Chapter 10. A 3-Manifold Invariant by State Summation -- Chapter 11. The Shadow World -- Chapter 12. The Witten-Reshetikhin- Turaev Invariant -- Chapter 13. Blinks ↦ 3-Gems: Recognizing 3-Manifolds -- Chapter 14. Tables of Quantum Invariants -- Bibliography -- Index |
| Record Nr. | UNINA-9910154743003321 |
|
Kauffman Louis H.
|
||
| Princeton, NJ : , : Princeton University Press, , [2016] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Three-Dimensional Link Theory and Invariants of Plane Curve Singularities. (AM-110), Volume 110 / / David Eisenbud, Walter D. Neumann
| Three-Dimensional Link Theory and Invariants of Plane Curve Singularities. (AM-110), Volume 110 / / David Eisenbud, Walter D. Neumann |
| Autore | Eisenbud David |
| Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
| Descrizione fisica | 1 online resource (184 pages) : illustration |
| Disciplina | 514.2 |
| Collana | Annals of Mathematics Studies |
| Soggetto topico |
Link theory
Invariants Curves, Plane Singularities (Mathematics) |
| Soggetto non controllato |
3-sphere
Alexander Grothendieck Alexander polynomial Algebraic curve Algebraic equation Algebraic geometry Algebraic surface Algorithm Ambient space Analytic function Approximation Big O notation Call graph Cartesian coordinate system Characteristic polynomial Closed-form expression Cohomology Computation Conjecture Connected sum Contradiction Coprime integers Corollary Curve Cyclic group Determinant Diagram (category theory) Diffeomorphism Dimension Disjoint union Eigenvalues and eigenvectors Equation Equivalence class Euler number Existential quantification Exterior (topology) Fiber bundle Fibration Foliation Fundamental group Geometry Graph (discrete mathematics) Ground field Homeomorphism Homology sphere Identity matrix Integer matrix Intersection form (4-manifold) Isolated point Isolated singularity Jordan normal form Knot theory Mathematical induction Monodromy matrix Monodromy N-sphere Natural transformation Newton polygon Newton's method Normal (geometry) Notation Pairwise Parametrization Plane curve Polynomial Power series Projective plane Puiseux series Quantity Rational function Resolution of singularities Riemann sphere Riemann surface Root of unity Scientific notation Seifert surface Set (mathematics) Sign (mathematics) Solid torus Special case Stereographic projection Submanifold Summation Theorem Three-dimensional space (mathematics) Topology Torus knot Torus Tubular neighborhood Unit circle Unit vector Unknot Variable (mathematics) |
| ISBN | 1-4008-8192-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Abstract -- Three-Dimensional Link Theory and Invariants of Plane Curve Singularities -- Introduction -- Review -- Preview -- Chapter I: Foundations -- Appendix to Chapter I: Algebraic Links -- Chapter II: Classification -- Chapter III: Invariants -- Chapter IV: Examples -- Chapter V: Relation to Plumbing -- References -- Backmatter |
| Record Nr. | UNINA-9910154742903321 |
|
Eisenbud David
|
||
| Princeton, NJ : , : Princeton University Press, , [2016] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The traveling salesman problem [[electronic resource] ] : a computational study / / David L. Applegate ... [et al.]
| The traveling salesman problem [[electronic resource] ] : a computational study / / David L. Applegate ... [et al.] |
| Autore | Applegate David L |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, c2006 |
| Descrizione fisica | 1 online resource (606 p.) |
| Disciplina | 511.6 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico | Traveling salesman problem |
| Soggetto non controllato |
AT&T Labs
Accuracy and precision Addition Algorithm Analysis of algorithms Applied mathematics Approximation algorithm Approximation Basic solution (linear programming) Best, worst and average case Bifurcation theory Big O notation CPLEX CPU time Calculation Chaos theory Column generation Combinatorial optimization Computation Computational resource Computer Connected component (graph theory) Connectivity (graph theory) Convex hull Cutting-plane method Delaunay triangulation Determinism Disjoint sets Dynamic programming Ear decomposition Engineering Enumeration Equation Estimation Euclidean distance Euclidean space Family of sets For loop Genetic algorithm George Dantzig Georgia Institute of Technology Greedy algorithm Hamiltonian path Hospitality Hypergraph Implementation Instance (computer science) Institute Integer Iteration Linear inequality Linear programming Mathematical optimization Mathematics Model of computation Neuroscience Notation Operations research Optimization problem Order by Pairwise Parameter (computer programming) Parity (mathematics) Percentage Polyhedron Polytope Pricing Princeton University Processing (programming language) Project Quantity Reduced cost Requirement Result Rice University Rutgers University Scientific notation Search algorithm Search tree Self-similarity Simplex algorithm Solution set Solver Source code Special case Stochastic Subroutine Subsequence Subset Summation Test set Theorem Theory Time complexity Trade-off Travelling salesman problem Tree (data structure) Upper and lower bounds Variable (computer science) Variable (mathematics) |
| ISBN |
1-283-25611-8
9786613256119 1-4008-4110-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Chapter 1. The Problem -- Chapter 2. Applications -- Chapter 3. Dantzig, Fulkerson, and Johnson -- Chapter 4. History of TSP Computation -- Chapter 5. LP Bounds and Cutting Planes -- Chapter 6. Subtour Cuts and PQ-Trees -- Chapter 7. Cuts from Blossoms and Blocks -- Chapter 8. Combs from Consecutive Ones -- Chapter 9. Combs from Dominoes -- Chapter 10. Cut Metamorphoses -- Chapter 11. Local Cuts -- Chapter 12. Managing the Linear Programming Problems -- Chapter 13. The Linear Programming Solver Chapter 14. Branching -- Chapter 14. Branching -- Chapter 15. Tour Finding -- Chapter 16. Computation -- Chapter 17. The Road Goes On -- Bibliography -- Index |
| Record Nr. | UNINA-9910789748903321 |
|
Applegate David L
|
||
| Princeton, : Princeton University Press, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||