Combinatorial Optimization [[electronic resource] ] : 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11–13, 2018, Revised Selected Papers / / edited by Jon Lee, Giovanni Rinaldi, A. Ridha Mahjoub |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (XXI, 430 p. 66 illus.) |
Disciplina | 519.3 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Numerical analysis Algorithms Artificial intelligence—Data processing Artificial intelligence Computer networks Discrete Mathematics in Computer Science Numerical Analysis Data Science Artificial Intelligence Computer Communication Networks |
ISBN | 3-319-96151-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Combinatorial Optimization -- Algorithms and Complexity -- Mathematical programming -- Operations research -- Stochastic optimization -- Multi-objective optimization -- Graphs -- Combinatorics. |
Record Nr. | UNISA-996466423703316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Combinatorial Optimization : 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11–13, 2018, Revised Selected Papers / / edited by Jon Lee, Giovanni Rinaldi, A. Ridha Mahjoub |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (XXI, 430 p. 66 illus.) |
Disciplina | 519.3 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Numerical analysis Algorithms Artificial intelligence—Data processing Artificial intelligence Computer networks Discrete Mathematics in Computer Science Numerical Analysis Data Science Artificial Intelligence Computer Communication Networks |
ISBN | 3-319-96151-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Combinatorial Optimization -- Algorithms and Complexity -- Mathematical programming -- Operations research -- Stochastic optimization -- Multi-objective optimization -- Graphs -- Combinatorics. |
Record Nr. | UNINA-9910349421903321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Combinatorial Optimization -- Eureka, You Shrink! [[electronic resource] ] : Papers Dedicated to Jack Edmonds. 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers / / edited by Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi |
Edizione | [1st ed. 2003.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
Descrizione fisica | 1 online resource (X, 214 p.) |
Disciplina | 519.3 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Probabilities
Computer science—Mathematics Algorithms Numerical analysis Computer graphics Probability Theory and Stochastic Processes Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity Numeric Computing Computer Graphics |
ISBN | 3-540-36478-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | “Eureka — You Skrink!” -- “Eureka — You Shrink!” -- Submodular Functions, Matroids, and Certain Polyhedra -- Matching: A Well-Solved Class of Integer Linear Programs -- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems -- Connected Matchings -- Hajós’ Construction and Polytopes -- Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection -- Solving Real-World ATSP Instances by Branch-and-Cut -- The Bundle Method for Hard Combinatorial Optimization Problems -- The One-Commodity Pickup-and-Delivery Travelling Salesman Problem -- Reconstructing a Simple Polytope from Its Graph -- An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming -- A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope -- Constructing New Facets of the Consecutive Ones Polytope -- A Simplex-Based Algorithm for 0-1 Mixed Integer Programming -- Mixed-Integer Value Functions in Stochastic Programming -- Exact Algorithms for NP-Hard Problems: A Survey. |
Record Nr. | UNISA-996466126103316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Combinatorial Optimization -- Eureka, You Shrink! : Papers Dedicated to Jack Edmonds. 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers / / edited by Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi |
Edizione | [1st ed. 2003.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
Descrizione fisica | 1 online resource (X, 214 p.) |
Disciplina | 519.3 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Probabilities
Computer science—Mathematics Algorithms Numerical analysis Computer graphics Probability Theory and Stochastic Processes Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity Numeric Computing Computer Graphics |
ISBN | 3-540-36478-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | “Eureka — You Skrink!” -- “Eureka — You Shrink!” -- Submodular Functions, Matroids, and Certain Polyhedra -- Matching: A Well-Solved Class of Integer Linear Programs -- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems -- Connected Matchings -- Hajós’ Construction and Polytopes -- Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection -- Solving Real-World ATSP Instances by Branch-and-Cut -- The Bundle Method for Hard Combinatorial Optimization Problems -- The One-Commodity Pickup-and-Delivery Travelling Salesman Problem -- Reconstructing a Simple Polytope from Its Graph -- An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming -- A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope -- Constructing New Facets of the Consecutive Ones Polytope -- A Simplex-Based Algorithm for 0-1 Mixed Integer Programming -- Mixed-Integer Value Functions in Stochastic Programming -- Exact Algorithms for NP-Hard Problems: A Survey. |
Record Nr. | UNINA-9910145911503321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Integer Programming and Combinatorial Optimization [[electronic resource] ] : 13th International Conference, IPCO 2008 Bertinoro, Italy, May 26-28, 2008 Proceedings / / edited by Andrea Lodi, Alessandro Panconesi, Giovanni Rinaldi |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XI, 477 p.) |
Disciplina | 519.7/7 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Numerical analysis Algorithms Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics |
ISBN | 3-540-68891-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Session 1 -- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables -- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs -- The Air Traffic Flow Management Problem: An Integer Optimization Approach -- Session 2 -- The Induced Disjoint Paths Problem -- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs -- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs -- A Polynomial Algorithm for Weighted Abstract Flow -- Session 3 -- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem -- Binary Positive Semidefinite Matrices and Associated Integer Polytopes -- Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities -- Session 4 -- Tight Bounds for Permutation Flow Shop Scheduling -- The Stochastic Machine Replenishment Problem -- A Polynomial Time Approximation Scheme for the Square Packing Problem -- Session 5 -- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints -- Computing with Multi-row Gomory Cuts -- Constraint Orbital Branching -- Session 6 -- A Fast, Simpler Algorithm for the Matroid Parity Problem -- Degree Bounded Matroids and Submodular Flows -- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle -- Session 7 -- Primal-Dual Schema for Capacitated Covering Problems -- Offline and Online Facility Leasing -- Importance Sampling via Load-Balanced Facility Location -- Session 8 -- A Constant Approximation Algorithm for the a priori Traveling Salesman Problem -- New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem -- Min Sum Edge Coloring in Multigraphs Via Configuration LP -- Session 9 -- An Improved Algorithm for Finding Cycles Through Elements -- The Stable Roommates Problem with Choice Functions -- A New Approach to Splitting-Off -- Session 10 -- Can Pure Cutting Plane Algorithms Work? -- The Mixing Set with Divisible Capacities -- A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging -- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles. |
Record Nr. | UNISA-996465589803316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Integer Programming and Combinatorial Optimization [[electronic resource] ] : 13th International Conference, IPCO 2008 Bertinoro, Italy, May 26-28, 2008 Proceedings / / edited by Andrea Lodi, Alessandro Panconesi, Giovanni Rinaldi |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XI, 477 p.) |
Disciplina | 519.7/7 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Numerical analysis Algorithms Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics |
ISBN | 3-540-68891-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Session 1 -- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables -- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs -- The Air Traffic Flow Management Problem: An Integer Optimization Approach -- Session 2 -- The Induced Disjoint Paths Problem -- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs -- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs -- A Polynomial Algorithm for Weighted Abstract Flow -- Session 3 -- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem -- Binary Positive Semidefinite Matrices and Associated Integer Polytopes -- Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities -- Session 4 -- Tight Bounds for Permutation Flow Shop Scheduling -- The Stochastic Machine Replenishment Problem -- A Polynomial Time Approximation Scheme for the Square Packing Problem -- Session 5 -- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints -- Computing with Multi-row Gomory Cuts -- Constraint Orbital Branching -- Session 6 -- A Fast, Simpler Algorithm for the Matroid Parity Problem -- Degree Bounded Matroids and Submodular Flows -- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle -- Session 7 -- Primal-Dual Schema for Capacitated Covering Problems -- Offline and Online Facility Leasing -- Importance Sampling via Load-Balanced Facility Location -- Session 8 -- A Constant Approximation Algorithm for the a priori Traveling Salesman Problem -- New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem -- Min Sum Edge Coloring in Multigraphs Via Configuration LP -- Session 9 -- An Improved Algorithm for Finding Cycles Through Elements -- The Stable Roommates Problem with Choice Functions -- A New Approach to Splitting-Off -- Session 10 -- Can Pure Cutting Plane Algorithms Work? -- The Mixing Set with Divisible Capacities -- A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging -- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles. |
Record Nr. | UNINA-9910483927303321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
New Perspectives in Medical Records : Meeting the Needs of Patients and Practitioners / / edited by Giovanni Rinaldi |
Edizione | [1st ed. 2017.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
Descrizione fisica | 1 online resource (XVI, 224 p. 44 illus., 41 illus. in color.) |
Disciplina | 651.5 |
Collana | TELe-Health |
Soggetto topico |
Health informatics
Health administration General practice (Medicine) Health Informatics Health Administration General Practice / Family Medicine |
ISBN | 3-319-28661-7 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Introduction. Medical Records: Are We at the Top? Is There Still Room for Innovation? -- EHR, EPR, PS, PHR: Different Medical Records for Different Aims: The Roles of the Doctors, Patients and Institutions -- An Infrastructural Approach to Clinical Information -- From Big Data to Big Insights. The Role of Platforms in Healthcare IT -- Shared Medical Record, Personal Health Folder and Health and Social Integrated Care in Catalonia. ICT Services for Integrated Care -- Visual Analytics of Electronic Health Records with a Focus on Time -- Military ICT and Innovative Networks for the Protection of People's Health -- Perspectives in Digital Health and Precision Medicine -- Medical Record for Clinicians: Present and Future Vision -- Addressing eHealth at the EU Level -- Clinical Information in Use. Problems, Outcomes and Challenges from Experience -- Medical Records, eHealth and Health IT. What are the Key Points for the Organizational Benefits and for the Improvements of the Modern Local Health Organizations? -- Disease Registry: A Tool for European Cross Border Medicine -- Cross Border Experiences in Health IT. What are the Requests for the Medical Record? Opportunities and Emerging Issues -- Innovative Tools and Data Sharing in Ageing Care: Solutions and Perspectives -- e_CardioNet: The Role of the Electronic Medical Records and ICT in Transnational Projects -- Telemedicine in Collaborative Diagnosis and Care of Congenital Heart Malformations -- Health Dossier in Italy - Elements for Reflection: What's New? What are Possible Improvements? -- The Role of Telemedicine and EHR in Supporting Care Pathways in the Management of Chronic Illness. The Experiences of the Lombardy Region. |
Record Nr. | UNINA-9910254482503321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|