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.
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 | ||
| ||
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 | ||
| ||