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.
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
| 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 | ||
| Materiale a stampa | ||
| 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
| 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 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computational Combinatorial Optimization [[electronic resource] ] : Optimal or Provably Near-Optimal Solutions / / edited by Michael Jünger, Denis Naddef
| Computational Combinatorial Optimization [[electronic resource] ] : Optimal or Provably Near-Optimal Solutions / / edited by Michael Jünger, Denis Naddef |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (X, 310 p.) |
| Disciplina | 519.7 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical optimization
Computer science—Mathematics Algorithms Information technology Business—Data processing Data structures (Computer science) Combinatorics Optimization Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity IT in Business Data Structures |
| ISBN | 3-540-45586-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms -- Projection and Lifting in Combinatorial Optimization -- Mathematical Programming Models and Formulations for Deterministic Production Planning Problems -- Lagrangian Relaxation -- Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS -- Branch, Cut, and Price: Sequential and Parallel -- TSP Cuts Which Do Not Conform to the Template Paradigm. |
| Record Nr. | UNISA-996465664603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions / / edited by Michael Jünger, Denis Naddef
| Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions / / edited by Michael Jünger, Denis Naddef |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (X, 310 p.) |
| Disciplina | 519.7 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical optimization
Computer science—Mathematics Algorithms Information technology Business—Data processing Data structures (Computer science) Combinatorial analysis Optimization Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity IT in Business Data Structures Combinatorics |
| ISBN | 3-540-45586-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms -- Projection and Lifting in Combinatorial Optimization -- Mathematical Programming Models and Formulations for Deterministic Production Planning Problems -- Lagrangian Relaxation -- Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS -- Branch, Cut, and Price: Sequential and Parallel -- TSP Cuts Which Do Not Conform to the Template Paradigm. |
| Record Nr. | UNINA-9910143921303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Digitale Transformation von Geschäftsmodellen : Grundlagen, Instrumente und Best Practices / / herausgegeben von Daniel Schallmo, Andreas Rusnjak, Johanna Anzengruber, Thomas Werani, Michael Jünger
| Digitale Transformation von Geschäftsmodellen : Grundlagen, Instrumente und Best Practices / / herausgegeben von Daniel Schallmo, Andreas Rusnjak, Johanna Anzengruber, Thomas Werani, Michael Jünger |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Wiesbaden : , : Springer Fachmedien Wiesbaden : , : Imprint : Springer Gabler, , 2017 |
| Descrizione fisica | 1 online resource (L, 700 S. 260 Abb., 182 Abb. in Farbe.) |
| Disciplina | 658.514 |
| Collana | Schwerpunkt Business Model Innovation |
| Soggetto topico |
Management
Industrial management Leadership Management information systems Innovation/Technology Management Business Strategy/Leadership Business Information Systems |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ger |
| Nota di contenuto | Grundlagen der Industrie 4.0 -- Grundlagen der Geschäftsmodell-Innovation -- Best Practice Beispiele von Geschäftsmodellen im Kontext der Industrie 4.0 -- Instrumente zur erfolgreichen Geschäftsmodell-Innovation im Kontext der Industrie 4.0. |
| Record Nr. | UNINA-9910149490003321 |
| Wiesbaden : , : Springer Fachmedien Wiesbaden : , : Imprint : Springer Gabler, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph Drawing [[electronic resource] ] : 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers / / edited by Petra Mutzel, Michael Jünger, Sebastian Leipert
| Graph Drawing [[electronic resource] ] : 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers / / edited by Petra Mutzel, Michael Jünger, Sebastian Leipert |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XVI, 528 p.) |
| Disciplina | 511/.5 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer software
Engineering design Computer science—Mathematics Computer graphics Algorithms Mathematical Software Engineering Design Discrete Mathematics in Computer Science Computer Graphics Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-45848-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Hierarchical Drawing -- A Fixed-Parameter Approach to Two-Layer Planarization -- How to Layer a Directed Acyclic Graph -- Fast and Simple Horizontal Coordinate Assignment -- Automated Visualization of Process Diagrams -- Planarity -- Planarization of Clustered Graphs -- An Algorithm for Finding Large Induced Planar Subgraphs -- A Characterization of DFS Cotree Critical Graphs -- Crossing Theory -- An Improved Lower Bound for Crossing Numbers -- Crossing-Critical Graphs and Path-Width -- One Sided Crossing Minimization Is NP-Hard for Sparse Graphs -- Compaction -- Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size -- Labeling Heuristics for Orthogonal Drawings -- Planar Graphs -- Untangling a Polygon -- Drawing with Fat Edges -- Symmetries -- Detecting Symmetries by Branch & Cut -- Drawing Graphs Symmetrically in Three Dimensions -- Interactive Drawing -- User Hints for Directed Graph Drawing -- Graph Drawing in Motion II -- Online Hierarchical Graph Drawing -- Representations -- Recognizing String Graphs Is Decidable -- On Intersection Graphs of Segments with Prescribed Slopes -- Aesthetics -- A Short Note on the History of Graph Drawing -- Towards an Aesthetic Invariant for Graph Drawing -- 2D-and 3D-Embeddings -- Orthogonal Drawings with Few Layers -- Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing -- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions -- Low-Distortion Embeddings of Trees -- Data Visualization -- Insight into Data through Visualization -- Floor-Planning -- Floor-Planning via Orderly Spanning Trees -- Disconnected Graph Layout and the Polyomino Packing Approach -- Planar Drawings -- Orthogonal Drawings of Plane Graphs without Bends -- Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution -- Corrected Printing of GD 2000 Paper -- On Polar Visibility Representations of Graphs -- Software Exhibition -- Tulip -- The ILOG JViews Graph Layout Module -- WAVE -- WilmaScope— An Interactive 3D Graph Visualisation System -- Exploration and Visualization of Computer Networks: Polyphemus and Hermes -- CrocoCosmos -- The Graph Drawing Server -- Drawing Database Schemas with DBdraw -- yFiles: Visualization and Automatic Layout of Graphs -- BioPath -- Graph Visualization API Library for Application Builders -- JGraph— A Java Based System for Drawing Graphs and Running Graph Algorithms -- Caesar Automatic Layout of UML Class Diagrams -- Visone Software for Visual Social Network Analysis -- Generating Schematic Cable Plans Using Springembedder Methods -- SugiBib -- Knowledge Index Manager -- Planarity Testing of Graphs on Base of a Spring Model -- AGD: A Library of Algorithms for Graph Drawing -- Industrial Plant Drawer -- Pajek— Analysis and Visualization of Large Networks -- GLIDE -- ViSta -- Graphviz— Open Source Graph Drawing Tools -- Graph Exchange Formats -- Exchanging Graphs with GXL -- GraphML Progress Report Structural Layer Proposal -- Graph Drawing Contest -- Graph-Drawing Contest Report. |
| Record Nr. | UNISA-996465395803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph Drawing : 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers / / edited by Petra Mutzel, Michael Jünger, Sebastian Leipert
| Graph Drawing : 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers / / edited by Petra Mutzel, Michael Jünger, Sebastian Leipert |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XVI, 528 p.) |
| Disciplina | 511/.5 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer software
Engineering design Computer science—Mathematics Computer graphics Algorithms Mathematical Software Engineering Design Discrete Mathematics in Computer Science Computer Graphics Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-45848-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Hierarchical Drawing -- A Fixed-Parameter Approach to Two-Layer Planarization -- How to Layer a Directed Acyclic Graph -- Fast and Simple Horizontal Coordinate Assignment -- Automated Visualization of Process Diagrams -- Planarity -- Planarization of Clustered Graphs -- An Algorithm for Finding Large Induced Planar Subgraphs -- A Characterization of DFS Cotree Critical Graphs -- Crossing Theory -- An Improved Lower Bound for Crossing Numbers -- Crossing-Critical Graphs and Path-Width -- One Sided Crossing Minimization Is NP-Hard for Sparse Graphs -- Compaction -- Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size -- Labeling Heuristics for Orthogonal Drawings -- Planar Graphs -- Untangling a Polygon -- Drawing with Fat Edges -- Symmetries -- Detecting Symmetries by Branch & Cut -- Drawing Graphs Symmetrically in Three Dimensions -- Interactive Drawing -- User Hints for Directed Graph Drawing -- Graph Drawing in Motion II -- Online Hierarchical Graph Drawing -- Representations -- Recognizing String Graphs Is Decidable -- On Intersection Graphs of Segments with Prescribed Slopes -- Aesthetics -- A Short Note on the History of Graph Drawing -- Towards an Aesthetic Invariant for Graph Drawing -- 2D-and 3D-Embeddings -- Orthogonal Drawings with Few Layers -- Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing -- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions -- Low-Distortion Embeddings of Trees -- Data Visualization -- Insight into Data through Visualization -- Floor-Planning -- Floor-Planning via Orderly Spanning Trees -- Disconnected Graph Layout and the Polyomino Packing Approach -- Planar Drawings -- Orthogonal Drawings of Plane Graphs without Bends -- Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution -- Corrected Printing of GD 2000 Paper -- On Polar Visibility Representations of Graphs -- Software Exhibition -- Tulip -- The ILOG JViews Graph Layout Module -- WAVE -- WilmaScope— An Interactive 3D Graph Visualisation System -- Exploration and Visualization of Computer Networks: Polyphemus and Hermes -- CrocoCosmos -- The Graph Drawing Server -- Drawing Database Schemas with DBdraw -- yFiles: Visualization and Automatic Layout of Graphs -- BioPath -- Graph Visualization API Library for Application Builders -- JGraph— A Java Based System for Drawing Graphs and Running Graph Algorithms -- Caesar Automatic Layout of UML Class Diagrams -- Visone Software for Visual Social Network Analysis -- Generating Schematic Cable Plans Using Springembedder Methods -- SugiBib -- Knowledge Index Manager -- Planarity Testing of Graphs on Base of a Spring Model -- AGD: A Library of Algorithms for Graph Drawing -- Industrial Plant Drawer -- Pajek— Analysis and Visualization of Large Networks -- GLIDE -- ViSta -- Graphviz— Open Source Graph Drawing Tools -- Graph Exchange Formats -- Exchanging Graphs with GXL -- GraphML Progress Report Structural Layer Proposal -- Graph Drawing Contest -- Graph-Drawing Contest Report. |
| Record Nr. | UNINA-9910143915803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Integer Programming and Combinatorial Optimization [[electronic resource] ] : 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings / / edited by Michael Jünger, Volker Kaibel
| Integer Programming and Combinatorial Optimization [[electronic resource] ] : 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings / / edited by Michael Jünger, Volker Kaibel |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XII, 488 p.) |
| Disciplina | 519.77 |
| 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 | 9783540321026 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Mixed-Integer Cuts from Cyclic Groups -- Optimizing over the First Chvàtal Closure -- Sequential Pairing of Mixed Integer Inequalities -- Approximate Min-max Relations for Odd Cycles in Planar Graphs -- Disjoint Cycles: Integrality Gap, Hardness, and Approximation -- A Combinatorial Algorithm to Find a Maximum Even Factor -- Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems -- On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem -- Inventory and Facility Location Models with Market Selection -- On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations -- Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials -- Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring -- On the Inefficiency of Equilibria in Congestion Games -- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times -- LP-Based Online Scheduling: From Single to Parallel Machines -- Unique Sink Orientations of Grids -- Jumping Doesn’t Help in Abstract Cubes -- Computing the Inertia from Sign Patterns -- Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem -- On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem -- Smoothed Analysis of Integer Programming -- Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs -- Approximation Algorithms for Stochastic Inventory Control Models -- On Two-Stage Stochastic Minimum Spanning Trees -- Combinatorial Analysis of Generic Matrix Pencils -- Power Optimization for Connectivity Problems -- Packing Steiner Forests -- Bidimensional Packing by Bilinear Programming -- On the L ???-Norm of Extreme Points for Crossing Supermodular Directed Network LPs -- Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks -- Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem -- Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems -- A Study of Domino-Parity and k-Parity Constraints for the TSP -- Not Every GTSP Facet Induces an STSP Facet. |
| Record Nr. | UNISA-996466121203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||