Doubly fed induction generator in an offshore power plant operated at rated V/Hz [[electronic resource] ] : preprint / / Eduard Muljadi, Mohit Singh, and Vahan Gevorgian |
Autore | Muljadi E |
Pubbl/distr/stampa | [Golden, CO] : , : National Renewable Energy Laboratory, , [2012] |
Descrizione fisica | 1 online resource (8 pages) : illustrations (some color) |
Altri autori (Persone) |
SinghMohit
GevorgianV (Vahan) |
Collana | Conference paper NREL/CP |
Soggetto topico |
Offshore wind power plants - Research
Induction generators - Research Wind power - Research |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Altri titoli varianti | Doubly fed induction generator in an offshore power plant operated at rated V/Hz |
Record Nr. | UNINA-9910702090003321 |
Muljadi E | ||
[Golden, CO] : , : National Renewable Energy Laboratory, , [2012] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Fixed-speed and variable-slip wind turbines providing spinning reserves to the grid : preprint / / E. Muljadi, M. Singh, and V. Gevorgian |
Autore | Muljadi E. |
Pubbl/distr/stampa | [Golden, CO] : , : National Renewable Energy Laboratory, , 2012 |
Descrizione fisica | 1 online resource (7 unnumbered pages) : color illustrations |
Collana | NREL/CP |
Soggetto topico |
Wind turbines - Aerodynamics
Wind power Distributed resources (Electric utilities) |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Altri titoli varianti | Fixed-speed and variable-slip wind turbines providing spinning reserves to the grid |
Record Nr. | UNINA-9910702324103321 |
Muljadi E. | ||
[Golden, CO] : , : National Renewable Energy Laboratory, , 2012 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Integer Programming and Combinatorial Optimization [[electronic resource] ] : 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021, Proceedings / / edited by Mohit Singh, David P. Williamson |
Edizione | [1st ed. 2021.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
Descrizione fisica | 1 online resource (XI, 490 p. 51 illus., 34 illus. in color.) |
Disciplina | 519.77 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Computer networks Algorithms Data structures (Computer science) Information theory Software engineering Mathematics of Computing Computer Communication Networks Design and Analysis of Algorithms Data Structures and Information Theory Software Engineering |
ISBN | 3-030-73879-5 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Improving the Approximation Ratio for Capacitated Vehicle Routing -- Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual -- Approximating the discrete time-cost tradeoff problem with bounded depth -- Sum-of-squares hierarchies for binary polynomial optimization -- Complexity, Exactness, and Rationality in Polynomial Optimization -- On the Geometry of Symmetry Breaking Inequalities -- Affinely representable lattices, stable matchings, and choice functions -- A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows -- A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with $2 \times 2$ submatrices -- On the implementation and strengthening of intersection cuts for QCQPs -- Lifting Convex Inequalities for Bipartite Bilinear Programs -- A Computational Status Update for Exact Rational Mixed Integer Programming -- New Exact Techniques Applied to a Class of Network Flow Formulations -- Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets -- Semi-Streaming Algorithms for Submodular Matroid Intersection -- Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems -- On the recognition of {a,b,c}-modular matrices -- On the Power of Static Assignment Policies for Robust Facility Location Problems -- Robust k-Center with Two Types of Radii -- Speed-Robust Scheduling - Rocks, Bricks, and Sand -- The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs -- Fast Quantum Subroutines for the Simplex Method -- Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators -- A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem -- Fixed Parameter Approximation Scheme for Min-max k-cut -- Computational Aspects of Relaxation Complexity -- Complexity of branch-and-bound and cutting planes in mixed-integer optimization – II -- Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs -- Proximity bounds for random integer programs -- On the Integrality Gap of Binary Integer Programs with Gaussian Data -- Linear Regression with Mismatched Data: a Provably Optimal Local Search Algorithm -- A New Integer Programming Formulation of the Graphical Traveling Salesman Problem -- Implications, conflicts, and reductions for Steiner trees. |
Record Nr. | UNISA-996464449003316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Integer Programming and Combinatorial Optimization : 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021, Proceedings / / edited by Mohit Singh, David P. Williamson |
Edizione | [1st ed. 2021.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
Descrizione fisica | 1 online resource (XI, 490 p. 51 illus., 34 illus. in color.) |
Disciplina | 519.77 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Computer networks Algorithms Data structures (Computer science) Information theory Software engineering Mathematics of Computing Computer Communication Networks Design and Analysis of Algorithms Data Structures and Information Theory Software Engineering |
ISBN | 3-030-73879-5 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Improving the Approximation Ratio for Capacitated Vehicle Routing -- Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual -- Approximating the discrete time-cost tradeoff problem with bounded depth -- Sum-of-squares hierarchies for binary polynomial optimization -- Complexity, Exactness, and Rationality in Polynomial Optimization -- On the Geometry of Symmetry Breaking Inequalities -- Affinely representable lattices, stable matchings, and choice functions -- A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows -- A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with $2 \times 2$ submatrices -- On the implementation and strengthening of intersection cuts for QCQPs -- Lifting Convex Inequalities for Bipartite Bilinear Programs -- A Computational Status Update for Exact Rational Mixed Integer Programming -- New Exact Techniques Applied to a Class of Network Flow Formulations -- Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets -- Semi-Streaming Algorithms for Submodular Matroid Intersection -- Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems -- On the recognition of {a,b,c}-modular matrices -- On the Power of Static Assignment Policies for Robust Facility Location Problems -- Robust k-Center with Two Types of Radii -- Speed-Robust Scheduling - Rocks, Bricks, and Sand -- The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs -- Fast Quantum Subroutines for the Simplex Method -- Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators -- A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem -- Fixed Parameter Approximation Scheme for Min-max k-cut -- Computational Aspects of Relaxation Complexity -- Complexity of branch-and-bound and cutting planes in mixed-integer optimization – II -- Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs -- Proximity bounds for random integer programs -- On the Integrality Gap of Binary Integer Programs with Gaussian Data -- Linear Regression with Mismatched Data: a Provably Optimal Local Search Algorithm -- A New Integer Programming Formulation of the Graphical Traveling Salesman Problem -- Implications, conflicts, and reductions for Steiner trees. |
Record Nr. | UNINA-9910484432803321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Iterative methods in combinatorial optimization / / Lap Chi Lau, R. Ravi, Mohit Singh [[electronic resource]] |
Autore | Lau Lap Chi |
Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2011 |
Descrizione fisica | 1 online resource (xi, 242 pages) : digital, PDF file(s) |
Disciplina | 518/.26 |
Collana | Cambridge texts in applied mathematics |
Soggetto topico |
Iterative methods (Mathematics)
Combinatorial optimization |
ISBN |
1-107-22177-3
1-283-11116-0 9786613111166 1-139-07652-3 0-511-97715-8 1-139-08334-1 1-139-07880-1 1-139-08107-1 1-139-07080-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Machine generated contents note: 1. Introduction; 2. Preliminaries; 3. Matching and vertex cover in bipartite graphs; 4. Spanning trees; 5. Matroids; 6. Arborescence and rooted connectivity; 7. Submodular flows and applications; 8. Network matrices; 9. Matchings; 10. Network design; 11. Constrained optimization problems; 12. Cut problems; 13. Iterative relaxation: early and recent examples; 14. Summary. |
Record Nr. | UNINA-9910460962603321 |
Lau Lap Chi | ||
Cambridge : , : Cambridge University Press, , 2011 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Iterative methods in combinatorial optimization / / Lap Chi Lau, R. Ravi, Mohit Singh [[electronic resource]] |
Autore | Lau Lap Chi |
Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2011 |
Descrizione fisica | 1 online resource (xi, 242 pages) : digital, PDF file(s) |
Disciplina | 518/.26 |
Collana | Cambridge texts in applied mathematics |
Soggetto topico |
Iterative methods (Mathematics)
Combinatorial optimization |
ISBN |
1-107-22177-3
1-283-11116-0 9786613111166 1-139-07652-3 0-511-97715-8 1-139-08334-1 1-139-07880-1 1-139-08107-1 1-139-07080-0 |
Classificazione | COM000000 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Machine generated contents note: 1. Introduction; 2. Preliminaries; 3. Matching and vertex cover in bipartite graphs; 4. Spanning trees; 5. Matroids; 6. Arborescence and rooted connectivity; 7. Submodular flows and applications; 8. Network matrices; 9. Matchings; 10. Network design; 11. Constrained optimization problems; 12. Cut problems; 13. Iterative relaxation: early and recent examples; 14. Summary. |
Record Nr. | UNINA-9910789560403321 |
Lau Lap Chi | ||
Cambridge : , : Cambridge University Press, , 2011 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Iterative methods in combinatorial optimization / / Lap Chi Lau, R. Ravi, Mohit Singh [[electronic resource]] |
Autore | Lau Lap Chi |
Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2011 |
Descrizione fisica | 1 online resource (xi, 242 pages) : digital, PDF file(s) |
Disciplina | 518/.26 |
Collana | Cambridge texts in applied mathematics |
Soggetto topico |
Iterative methods (Mathematics)
Combinatorial optimization |
ISBN |
1-107-22177-3
1-283-11116-0 9786613111166 1-139-07652-3 0-511-97715-8 1-139-08334-1 1-139-07880-1 1-139-08107-1 1-139-07080-0 |
Classificazione | COM000000 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Machine generated contents note: 1. Introduction; 2. Preliminaries; 3. Matching and vertex cover in bipartite graphs; 4. Spanning trees; 5. Matroids; 6. Arborescence and rooted connectivity; 7. Submodular flows and applications; 8. Network matrices; 9. Matchings; 10. Network design; 11. Constrained optimization problems; 12. Cut problems; 13. Iterative relaxation: early and recent examples; 14. Summary. |
Record Nr. | UNINA-9910821985403321 |
Lau Lap Chi | ||
Cambridge : , : Cambridge University Press, , 2011 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Oscillation damping : a comparison of wind and photovoltaic power plant capabilities / / M. Singh ... [and others] |
Pubbl/distr/stampa | [Golden, Colo.] : , : National Renewable Energy Laboratory, , [2014] |
Descrizione fisica | 1 online resource (9 unnumbered pages) : illustrations |
Altri autori (Persone) | SinghMohit |
Collana | NREL/CP |
Soggetto topico |
Electric power system stability
Electric power systems - Control Oscillations Damping (Mechanics) |
Soggetto genere / forma | Conference papers and proceedings. |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Altri titoli varianti | Oscillation damping |
Record Nr. | UNINA-9910702631303321 |
[Golden, Colo.] : , : National Renewable Energy Laboratory, , [2014] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
User guide for PV dynamic model simulation written on PSCAD platform / / E. Muljadi, M. Singh, and V. Gevorgian |
Autore | Muljadi E. |
Pubbl/distr/stampa | Golden, CO, : National Renewable Energy Laboratory, November 2014 |
Descrizione fisica | 1 online resource (viii, 52 pages) : color illustrations |
Collana | NREL/TP |
Soggetto topico |
Photovoltaic power systems - Computer simulation
Electric inverters |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Altri titoli varianti |
User guide for PhotoVoltaic dynamic model simulation written on PSCAD platform
PV dynamic model simulation written on PSCAD platform |
Record Nr. | UNINA-9910703599403321 |
Muljadi E. | ||
Golden, CO, : National Renewable Energy Laboratory, November 2014 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|