top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Advanced Graph Theory [[electronic resource] /] / by Santosh Kumar Yadav
Advanced Graph Theory [[electronic resource] /] / by Santosh Kumar Yadav
Autore Yadav Santosh Kumar
Edizione [1st ed. 2023.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023
Descrizione fisica 1 online resource (294 pages)
Disciplina 574
Soggetto topico Graph theory
Discrete mathematics
Graph Theory
Applications of Discrete Mathematics
Discrete Mathematics
ISBN 3-031-22562-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Introduction -- Trees -- Planar Graphs -- Directed Graphs -- Matching and Covering -- Colouring of Graphs -- Enumeration and Pölya’s Theorem -- Spectral Properties of Graph -- Emerging Trends in Graph Theory.
Record Nr. UNINA-9910731471503321
Yadav Santosh Kumar  
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Advanced graph theory and combinatorics / / Michel Rigo
Advanced graph theory and combinatorics / / Michel Rigo
Autore Rigo Michel
Pubbl/distr/stampa London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2016
Descrizione fisica 1 online resource : illustrations
Disciplina 511.5
Collana Computer Engineering Series
Soggetto topico Graph theory
Combinatorial analysis
ISBN 1-119-05864-3
1-119-05861-9
1-119-00898-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910153179703321
Rigo Michel  
London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2016
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Advanced graph theory and combinatorics / / Michel Rigo
Advanced graph theory and combinatorics / / Michel Rigo
Autore Rigo Michel
Pubbl/distr/stampa London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2016
Descrizione fisica 1 online resource : illustrations
Disciplina 511.5
Collana Computer Engineering Series
Soggetto topico Graph theory
Combinatorial analysis
ISBN 1-119-05864-3
1-119-05861-9
1-119-00898-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910820998803321
Rigo Michel  
London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2016
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Advanced Topics in Fuzzy Graph Theory [[electronic resource] /] / by John N. Mordeson, Sunil Mathew
Advanced Topics in Fuzzy Graph Theory [[electronic resource] /] / by John N. Mordeson, Sunil Mathew
Autore Mordeson John N
Edizione [1st ed. 2019.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica 1 online resource (XV, 209 p. 73 illus., 2 illus. in color.)
Disciplina 511.5
Collana Studies in Fuzziness and Soft Computing
Soggetto topico Computational intelligence
Graph theory
Artificial intelligence
Game theory
Computational Intelligence
Graph Theory
Artificial Intelligence
Game Theory, Economics, Social and Behav. Sciences
ISBN 3-030-04215-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Preliminaries -- Connectivity in Fuzzy Graphs -- Connectivity and Wiener Indices of Fuzzy Graphs -- Distances and Convexity in Fuzzy Graphs -- Aggregation Operators and t-Norm Fuzzy Graphs -- Dialectic Synthesis.
Record Nr. UNINA-9910483863903321
Mordeson John N  
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Advances in Mathematical Sciences [[electronic resource] ] : AWM Research Symposium, Houston, TX, April 2019 / / edited by Bahar Acu, Donatella Danielli, Marta Lewicka, Arati Pati, Saraswathy RV, Miranda Teboh-Ewungkem
Advances in Mathematical Sciences [[electronic resource] ] : AWM Research Symposium, Houston, TX, April 2019 / / edited by Bahar Acu, Donatella Danielli, Marta Lewicka, Arati Pati, Saraswathy RV, Miranda Teboh-Ewungkem
Edizione [1st ed. 2020.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Descrizione fisica 1 online resource : illustrations (some color)
Disciplina 510
Collana Association for Women in Mathematics Series
Soggetto topico Mathematics
Combinatorics
Graph theory
Numerical analysis
Commutative algebra
Commutative rings
Topology
Mathematics, general
Graph Theory
Numerical Analysis
Commutative Rings and Algebras
ISBN 3-030-42687-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Preface -- I. From the Plenary Talks -- Finite element methods for elliptic distributed optimal control problems with pointwise state constraints (S.C. Brenner) -- II. Algebraic Combinatorics and Graph Theory -- Some q-exponential formulas involving the double lowering operator ψ for a tridiagonal pair (S. Bockting-Conrad) -- Distance graphs generated by five primes (D.D-F. Liu, G. Robinson, A. Chavez) -- Combinatorial characterization of queer supercrystals (M. Gillespie, G. Hawkes, W. Poh, A. Schilling) -- (Tenner) -- III. Algebraic Biology -- From chaos to permanence using control theory (S. Koshy-Chenthittayil, E. Dimitrova) -- Classification on large networks (A. Haupt, T. Schultz, M. Kharami, N. Tran) -- Gröbner bases of convex neural code ideals (K. Phillipson, E.S. Dimitrova, M. Honecker, J. Hu, Q. Liang) -- Gröbner bases of convex neural code ideals (B. Stigler, A. Zhang) -- IV. Commutative Algebra -- Depth of powers of squarefree monomial ideals (L. Fouli, H.T. Hà, S. Morey) -- A note on the uniqueness of zero-divisor graphs with loops (A. Li, R. Miller, R.P. Tucci) -- Some combinatorial cases of the three matrix analog of Gerstenhaber’s theorem (J. Rajchgot, M. Satriano, W. Shen) -- Structure of semigroup rings (H. Srinivasan) -- Using Monte Carlo particle methods to estimate and quantify uncertainty in periodic parameters (A. Arnold) -- A note on singularity formation for nonlocal transport equation (V. Hoang, M. Radosz) -- Prescribing initial values for the sticky particle system (R. Hynd) -- Towards directed collapsibility (R. Belton, R. Brooks, S. Ebli, L. Fajstrup, B.T. Fasy, C. Ray, N. Sanderson, E. Vidaurre) -- Contact Open Books and Sympectic Lefschetz Fibrations (B. Acu) -- A robust preconditioner for high-contrast problems (Y. Gorb, D. Kurzanova, Y. Kuznetsov) -- On the dimension reduction in prestrained elasticity (S. Jimezes Bolanos) -- Machine learning in crowd flow exit data (F.P. Medina) -- The matter of shape (M. Ozkar) -- Being research-based and research-minded in helping K-12 mathematics education (A. Ekmekci, A. Papakonstantinou) -- The Rice University school mathematics project (A. Papakonstantinou, A. Ekmekci).
Record Nr. UNISA-996418253603316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Advances in Mathematical Sciences [[electronic resource] ] : AWM Research Symposium, Houston, TX, April 2019 / / edited by Bahar Acu, Donatella Danielli, Marta Lewicka, Arati Pati, Saraswathy RV, Miranda Teboh-Ewungkem
Advances in Mathematical Sciences [[electronic resource] ] : AWM Research Symposium, Houston, TX, April 2019 / / edited by Bahar Acu, Donatella Danielli, Marta Lewicka, Arati Pati, Saraswathy RV, Miranda Teboh-Ewungkem
Edizione [1st ed. 2020.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Descrizione fisica 1 online resource : illustrations (some color)
Disciplina 510
Collana Association for Women in Mathematics Series
Soggetto topico Mathematics
Combinatorics
Graph theory
Numerical analysis
Commutative algebra
Commutative rings
Topology
Mathematics, general
Graph Theory
Numerical Analysis
Commutative Rings and Algebras
ISBN 3-030-42687-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Preface -- I. From the Plenary Talks -- Finite element methods for elliptic distributed optimal control problems with pointwise state constraints (S.C. Brenner) -- II. Algebraic Combinatorics and Graph Theory -- Some q-exponential formulas involving the double lowering operator ψ for a tridiagonal pair (S. Bockting-Conrad) -- Distance graphs generated by five primes (D.D-F. Liu, G. Robinson, A. Chavez) -- Combinatorial characterization of queer supercrystals (M. Gillespie, G. Hawkes, W. Poh, A. Schilling) -- (Tenner) -- III. Algebraic Biology -- From chaos to permanence using control theory (S. Koshy-Chenthittayil, E. Dimitrova) -- Classification on large networks (A. Haupt, T. Schultz, M. Kharami, N. Tran) -- Gröbner bases of convex neural code ideals (K. Phillipson, E.S. Dimitrova, M. Honecker, J. Hu, Q. Liang) -- Gröbner bases of convex neural code ideals (B. Stigler, A. Zhang) -- IV. Commutative Algebra -- Depth of powers of squarefree monomial ideals (L. Fouli, H.T. Hà, S. Morey) -- A note on the uniqueness of zero-divisor graphs with loops (A. Li, R. Miller, R.P. Tucci) -- Some combinatorial cases of the three matrix analog of Gerstenhaber’s theorem (J. Rajchgot, M. Satriano, W. Shen) -- Structure of semigroup rings (H. Srinivasan) -- Using Monte Carlo particle methods to estimate and quantify uncertainty in periodic parameters (A. Arnold) -- A note on singularity formation for nonlocal transport equation (V. Hoang, M. Radosz) -- Prescribing initial values for the sticky particle system (R. Hynd) -- Towards directed collapsibility (R. Belton, R. Brooks, S. Ebli, L. Fajstrup, B.T. Fasy, C. Ray, N. Sanderson, E. Vidaurre) -- Contact Open Books and Sympectic Lefschetz Fibrations (B. Acu) -- A robust preconditioner for high-contrast problems (Y. Gorb, D. Kurzanova, Y. Kuznetsov) -- On the dimension reduction in prestrained elasticity (S. Jimezes Bolanos) -- Machine learning in crowd flow exit data (F.P. Medina) -- The matter of shape (M. Ozkar) -- Being research-based and research-minded in helping K-12 mathematics education (A. Ekmekci, A. Papakonstantinou) -- The Rice University school mathematics project (A. Papakonstantinou, A. Ekmekci).
Record Nr. UNINA-9910484757203321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Advances in network complexity / / edited by Matthias Dehmer, Abbe Mowshowitz and Frank Emmert-Streib
Advances in network complexity / / edited by Matthias Dehmer, Abbe Mowshowitz and Frank Emmert-Streib
Pubbl/distr/stampa Weinheim, : Wiley-Blackwell, c2013
Descrizione fisica 1 online resource (xiv, 293 pages) : illustrations
Disciplina 003.72
Collana Quantitative and network biology
Soggetto topico System analysis
Computational complexity
Network analysis (Planning) - Mathematical models
Graph theory
ISBN 3-527-67048-3
3-527-67046-7
3-527-67047-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Advances in Network Complexity; Contents; Preface; List of Contributors; 1 Functional Complexity Based on Topology; 1.1 Introduction; 1.2 A Measure for the Functional Complexity of Networks; 1.2.1 Topological Equivalence of LCE-Graphs; 1.2.2 Vertex Resolution Patterns; 1.2.3 Kauffman States for Link Invariants; 1.2.4 Definition of the Complexity Measure; 1.3 Applications; 1.3.1 Creation of a Loop; 1.3.2 Networks of Information; 1.3.3 Transport Networks of Cargo; 1.3.4 Boolean Networks of Gene Regulation; 1.3.5 Topological Quantum Systems; 1.3.6 Steering Dynamics Stored in Knots and Links
1.4 ConclusionsReferences; 2 Connections Between Artificial Intelligence and Computational Complexity and the Complexity of Graphs; 2.1 Introduction; 2.2 Representation Methods; 2.3 Searching Methods; 2.4 Turing Machines; 2.5 Fuzzy Logic and Fuzzy Graphs; 2.6 Fuzzy Optimization; 2.7 Fuzzy Systems; 2.8 Problems Related to AI; 2.9 Topology of Complex Networks; 2.10 Hierarchies; 2.10.1 Deterministic Case; 2.10.2 Nondeterministic Case; 2.10.3 Alternating Case; 2.11 Graph Entropy; 2.12 Kolmogorov Complexity; 2.13 Conclusion; References
3 Selection-Based Estimates of Complexity Unravel Some Mechanisms and Selective Pressures Underlying the Evolution of Complexity in Artificial Networks3.1 Introduction; 3.2 Complexity and Evolution; 3.3 Macroscopic Quantification of Organismal Complexity; 3.4 Selection-Based Methods of Complexity; 3.5 Informational Complexity; 3.6 Fisher Geometric Model; 3.7 The Cost of Complexity; 3.8 Quantifying Phenotypic Complexity; 3.8.1 Mutation-Based Method: Mutational Phenotypic Complexity (MPC); 3.8.2 Drift Load Based Method: Effective Phenotypic Complexity (EPC)
3.8.3 Statistical Method: Principal Component Phenotypic Complexity (PCPC)3.9 Darwinian Adaptive Neural Networks (DANN); 3.10 The Different Facets of Complexity; 3.11 Mechanistic Understanding of Phenotypic Complexity; 3.12 Selective Pressures Acting on Phenotypic Complexity; 3.13 Conclusion and Perspectives; References; 4 Three Types of Network Complexity Pyramid; 4.1 Introduction; 4.2 The First Type: The Life's Complexity Pyramid (LCP); 4.3 The Second Type: Network Model Complexity Pyramid; 4.3.1 The Level-7: Euler (Regular) Graphs; 4.3.2 The Level-6: Erd€os-R enyi Random Graph
4.3.3 The Level-5: Small-World Network and Scale-Free Models4.3.4 The Level-4: Weighted Evolving Network Models; 4.3.5 The Bottom Three Levels of the NMCP; 4.3.5.1 The Level-3: The HUHPNM; 4.3.5.2 The Level-2: The LUHNM; 4.3.5.3 The Level-1: The LUHNM-VSG; 4.4 The Third Type: Generalized Farey Organized Network Pyramid; 4.4.1 Construction Method of the Generalized Farey Tree Network (GFTN); 4.4.2 Main Results of the GFTN; 4.4.2.1 Degree Distribution; 4.4.2.2 Clustering Coefficient; 4.4.2.3 Diameter and Small World; 4.4.2.4 Degree-Degree Correlations; 4.4.3 Weighted Property of GFTN
4.4.4 Generalized Farey Organized Network Pyramid (GFONP)
Record Nr. UNINA-9910139042303321
Weinheim, : Wiley-Blackwell, c2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Advances in network complexity / / edited by Matthias Dehmer, Abbe Mowshowitz and Frank Emmert-Streib
Advances in network complexity / / edited by Matthias Dehmer, Abbe Mowshowitz and Frank Emmert-Streib
Pubbl/distr/stampa Weinheim, : Wiley-Blackwell, c2013
Descrizione fisica 1 online resource (xiv, 293 pages) : illustrations
Disciplina 003.72
Collana Quantitative and network biology
Soggetto topico System analysis
Computational complexity
Network analysis (Planning) - Mathematical models
Graph theory
ISBN 3-527-67048-3
3-527-67046-7
3-527-67047-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Advances in Network Complexity; Contents; Preface; List of Contributors; 1 Functional Complexity Based on Topology; 1.1 Introduction; 1.2 A Measure for the Functional Complexity of Networks; 1.2.1 Topological Equivalence of LCE-Graphs; 1.2.2 Vertex Resolution Patterns; 1.2.3 Kauffman States for Link Invariants; 1.2.4 Definition of the Complexity Measure; 1.3 Applications; 1.3.1 Creation of a Loop; 1.3.2 Networks of Information; 1.3.3 Transport Networks of Cargo; 1.3.4 Boolean Networks of Gene Regulation; 1.3.5 Topological Quantum Systems; 1.3.6 Steering Dynamics Stored in Knots and Links
1.4 ConclusionsReferences; 2 Connections Between Artificial Intelligence and Computational Complexity and the Complexity of Graphs; 2.1 Introduction; 2.2 Representation Methods; 2.3 Searching Methods; 2.4 Turing Machines; 2.5 Fuzzy Logic and Fuzzy Graphs; 2.6 Fuzzy Optimization; 2.7 Fuzzy Systems; 2.8 Problems Related to AI; 2.9 Topology of Complex Networks; 2.10 Hierarchies; 2.10.1 Deterministic Case; 2.10.2 Nondeterministic Case; 2.10.3 Alternating Case; 2.11 Graph Entropy; 2.12 Kolmogorov Complexity; 2.13 Conclusion; References
3 Selection-Based Estimates of Complexity Unravel Some Mechanisms and Selective Pressures Underlying the Evolution of Complexity in Artificial Networks3.1 Introduction; 3.2 Complexity and Evolution; 3.3 Macroscopic Quantification of Organismal Complexity; 3.4 Selection-Based Methods of Complexity; 3.5 Informational Complexity; 3.6 Fisher Geometric Model; 3.7 The Cost of Complexity; 3.8 Quantifying Phenotypic Complexity; 3.8.1 Mutation-Based Method: Mutational Phenotypic Complexity (MPC); 3.8.2 Drift Load Based Method: Effective Phenotypic Complexity (EPC)
3.8.3 Statistical Method: Principal Component Phenotypic Complexity (PCPC)3.9 Darwinian Adaptive Neural Networks (DANN); 3.10 The Different Facets of Complexity; 3.11 Mechanistic Understanding of Phenotypic Complexity; 3.12 Selective Pressures Acting on Phenotypic Complexity; 3.13 Conclusion and Perspectives; References; 4 Three Types of Network Complexity Pyramid; 4.1 Introduction; 4.2 The First Type: The Life's Complexity Pyramid (LCP); 4.3 The Second Type: Network Model Complexity Pyramid; 4.3.1 The Level-7: Euler (Regular) Graphs; 4.3.2 The Level-6: Erd€os-R enyi Random Graph
4.3.3 The Level-5: Small-World Network and Scale-Free Models4.3.4 The Level-4: Weighted Evolving Network Models; 4.3.5 The Bottom Three Levels of the NMCP; 4.3.5.1 The Level-3: The HUHPNM; 4.3.5.2 The Level-2: The LUHNM; 4.3.5.3 The Level-1: The LUHNM-VSG; 4.4 The Third Type: Generalized Farey Organized Network Pyramid; 4.4.1 Construction Method of the Generalized Farey Tree Network (GFTN); 4.4.2 Main Results of the GFTN; 4.4.2.1 Degree Distribution; 4.4.2.2 Clustering Coefficient; 4.4.2.3 Diameter and Small World; 4.4.2.4 Degree-Degree Correlations; 4.4.3 Weighted Property of GFTN
4.4.4 Generalized Farey Organized Network Pyramid (GFONP)
Record Nr. UNINA-9910815777903321
Weinheim, : Wiley-Blackwell, c2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Advances in Neural Computation, Machine Learning, and Cognitive Research II [[electronic resource] ] : Selected Papers from the XX International Conference on Neuroinformatics, October 8-12, 2018, Moscow, Russia / / edited by Boris Kryzhanovsky, Witali Dunin-Barkowski, Vladimir Redko, Yury Tiumentsev
Advances in Neural Computation, Machine Learning, and Cognitive Research II [[electronic resource] ] : Selected Papers from the XX International Conference on Neuroinformatics, October 8-12, 2018, Moscow, Russia / / edited by Boris Kryzhanovsky, Witali Dunin-Barkowski, Vladimir Redko, Yury Tiumentsev
Edizione [1st ed. 2019.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica 1 online resource (XVII, 344 p. 121 illus.)
Disciplina 006.32
Collana Studies in Computational Intelligence
Soggetto topico Computational intelligence
Graph theory
Control engineering
Artificial intelligence
Bioinformatics
Computational Intelligence
Graph Theory
Control and Systems Theory
Artificial Intelligence
Computational and Systems Biology
ISBN 3-030-01328-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910483077703321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Advances in Optimization and Decision Science for Society, Services and Enterprises [[electronic resource] ] : ODS, Genoa, Italy, September 4-7, 2019 / / edited by Massimo Paolucci, Anna Sciomachen, Pierpaolo Uberti
Advances in Optimization and Decision Science for Society, Services and Enterprises [[electronic resource] ] : ODS, Genoa, Italy, September 4-7, 2019 / / edited by Massimo Paolucci, Anna Sciomachen, Pierpaolo Uberti
Edizione [1st ed. 2019.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica 1 online resource (XI, 503 p. 77 illus., 49 illus. in color.)
Disciplina 519.3
Collana AIRO Springer Series
Soggetto topico Operations research
Management science
Calculus of variations
Graph theory
Game theory
Computer science—Mathematics
Operations Research, Management Science
Calculus of Variations and Optimal Control; Optimization
Graph Theory
Game Theory, Economics, Social and Behav. Sciences
Math Applications in Computer Science
ISBN 3-030-34960-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1 C. Cervellera et al., A receding horizon approach for berth allocation based on random search optimization -- 2 G. Di Tollo et al., Integrating ship movement scheduling and tug assignment within a canal harbor -- 3 G. Auricchio et al., The Maximum Nearby Flow Problem -- 4 T. Alves de Queiroz et al., Linear models for portfolio selection with real features -- 5 M. Maggi and P. Uberti, Portfolio Leverage in Asset Allocation Problems -- 6 V. Cacchiani et al., Energy-Efficient Train Control -- 7 C. Cervellera and D. Macciò, Gradient boosting with extreme learning machines for the optimization of nonlinear functionals -- 8 M. Benini et al., A MILP model for biological sample transportation in healthcare -- 9 E. Marcelli and R. De Leone, Infinite Kernel Extreme Learning Machine -- 10 A. Betti and M. Gori, Least Action Principles and Well-Posed Learning Problems -- 11 M. Casazza and A. Ceselli, Heuristic data-driven feasibility on Integrated Planning and Scheduling -- 12 M. Barbato et al., Evaluating automated storage and retrieval system policies with simulation and optimization -- 13 E. Tresoldi and A. Ceselli, Rolling-horizon heuristics for capacitated stochastic inventory problems with forecast updates -- 14 M. Barbato et al., Paths and matchings in an automated warehouse -- 15 H. Aldossary and G. Coates, Coordinating the Emergency Response of Ambulances to Multiple Mass Casualty Incidents using an Optimization-based Approach -- 16 L. Scrimali and G. Fargetta, A game theory model of online content competition -- 17 G. Cappello and P. Daniele, A Variational Formulation for a Human Migration Problem -- 18 M. Cerulli et al., Flying safely by bilevel programming -- 19 S. Basso and A. Ceselli, Computational evaluation of data driven local search for MIP decompositions -- 20 G. Colajanni, An integer programming formulation for University Course Timetabling -- 21 P. Hosein et al., On the Sizing of Security Personnel Staff while accounting for Overtime Pay -- 22 M.‐S. Vié and N. Zufferey, Dynamic Tabu Search for Enhancing the Productivity of a Bottle Production Line -- 23 M. Boccia et al., Swap minimization in nearest neighbour quantum circuits: an ILP formulation -- 24 M. Passacantando and F. Raciti, A traffic equilibrium nonlinear programming model for optimizing road maintenance investments -- 25 L. Mastroeni et al., Opinion dynamics in multi-agent systems under proportional updating and any-to-any influence -- 26 M. F. Monaco and M. Sammarra, A new formulation of the single door truck scheduling problem -- 27 L. Rarità, Optimization of car traffic in emergency conditions -- 28 M. E. Bruni at al., The Cumulative Capacitated Vehicle Routing Problem with Profits under Uncertainty -- 29 P. Beraldi et al., Dealing with the stochastic home energy management problem -- 30 J.-F. Côté et al., Optimization Methods for the Same-Day Delivery Problem -- 31 D. Ambrosino and V. Asta, Intermodality and rail transport: focus on port rail shunting operations -- 32 D. Ferone et al., The k-Color Shortest Path Problem -- 33 M. E. Bruni et al., The Traveling Repairman Problem App for Mobile Phones: a Case on Perishable Product Delivery -- 34 R. Tison and N. Zufferey, Integrating Vehicle Routing and Resource Allocation in a Pharmaceutical Network -- 35 E. Parra, A real case on making strategic logistics decisions with production and inventory optimization models -- 36 A. Alves da Silva Mundim et al., A Bi-objective Mixed Integer Model for the Single Link Inventory Routing Problem Using the e-constraint Method -- 37 M. Pour-Massahian-Tafti et al., Models for Disassembly Lot Sizing Problem with Decisions on Surplus Inventory -- 38 R. Berruto et al., Learning inventory control rules for perishable items by simulation-based optimization -- 39 C. Cerrone et al., A Genetic Algorithm for Minimum Conflict Weighted Spanning Tree Problem -- 40 G. Lancia and M. Dalpasso, Algorithmic strategies for a fast exploration of the TSP 4-OPT neighborhood -- 41 M. Barbato et al., A computational evaluation of online ATSP algorithms -- 42 F. Wamser et al., Modeling of Traffic Flows in Internet of Things Using Renewal Approximation -- 43 F. Davoli et al., Flow Assignment in Multi-Core Network Processors.
Record Nr. UNINA-9910370253803321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui