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.
Construct, Merge, Solve & Adapt : A Hybrid Metaheuristic for Combinatorial Optimization / / by Christian Blum
| Construct, Merge, Solve & Adapt : A Hybrid Metaheuristic for Combinatorial Optimization / / by Christian Blum |
| Autore | Blum Christian |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (202 pages) |
| Disciplina | 006.3 |
| Collana | Computational Intelligence Methods and Applications |
| Soggetto topico |
Artificial intelligence
Computational intelligence Computer science Operations research Management science Computer simulation Artificial Intelligence Computational Intelligence Theory of Computation Operations Research, Management Science Computer Modelling Optimització combinatòria |
| ISBN | 9783031601033 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction to CMSA -- Self-Adaptive CMSA -- Adding Learning to CMSA -- Replacing Hard Mathematical Models with Set Covering Formulations -- Application of CMSA in the Presence of Non-Binary Variables -- Additional Research Lines Concerning CMSA. |
| Record Nr. | UNINA-9910866571103321 |
Blum Christian
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Dynamic programming multi-objective combinatorial optimization / / Michal Mankowski, Mikhail Moshkov
| Dynamic programming multi-objective combinatorial optimization / / Michal Mankowski, Mikhail Moshkov |
| Autore | Mankowski Michal |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (213 pages) : illustrations |
| Disciplina | 519.64 |
| Soggetto topico |
Computational intelligence
Programming techniques Programació dinàmica Optimització combinatòria |
| Soggetto genere / forma | Llibres electrònics |
| ISBN | 3-030-63920-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910484820703321 |
|
Mankowski Michal
|
||
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Exact and heuristic methods in combinatorial optimization : a study on the linear ordering and the maximum diversity problem / / Rafael Martí and Gerhard Reinelt
| Exact and heuristic methods in combinatorial optimization : a study on the linear ordering and the maximum diversity problem / / Rafael Martí and Gerhard Reinelt |
| Autore | Martí Rafael (Rafael Cunquero) |
| Edizione | [2nd ed.] |
| Pubbl/distr/stampa | Berlin, Germany : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (232 pages) |
| Disciplina | 519.64 |
| Collana | Applied Mathematical Sciences |
| Soggetto topico |
Sequences (Mathematics)
Mathematical optimization Optimització combinatòria Successions (Matemàtica) |
| Soggetto genere / forma | Llibres electrònics |
| ISBN | 3-662-64877-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910552731503321 |
|
Martí Rafael (Rafael Cunquero)
|
||
| Berlin, Germany : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Exact and heuristic methods in combinatorial optimization : a study on the linear ordering and the maximum diversity problem / / Rafael Martí and Gerhard Reinelt
| Exact and heuristic methods in combinatorial optimization : a study on the linear ordering and the maximum diversity problem / / Rafael Martí and Gerhard Reinelt |
| Autore | Martí Rafael (Rafael Cunquero) |
| Edizione | [2nd ed.] |
| Pubbl/distr/stampa | Berlin, Germany : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (232 pages) |
| Disciplina | 519.64 |
| Collana | Applied Mathematical Sciences |
| Soggetto topico |
Sequences (Mathematics)
Mathematical optimization Optimització combinatòria Successions (Matemàtica) |
| Soggetto genere / forma | Llibres electrònics |
| ISBN | 3-662-64877-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466418403316 |
|
Martí Rafael (Rafael Cunquero)
|
||
| Berlin, Germany : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graphs and combinatorial optimization : from theory to applications : CTW2020 proceedings / / Claudio Gentile, Giuseppe Stecca, Paolo Ventura, editors
| Graphs and combinatorial optimization : from theory to applications : CTW2020 proceedings / / Claudio Gentile, Giuseppe Stecca, Paolo Ventura, editors |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (XIII, 413 p. 97 illus., 38 illus. in color.) |
| Disciplina | 519.3 |
| Collana | AIRO Springer Series |
| Soggetto topico |
Combinatorial optimization
Optimització combinatòria |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN | 3-030-63072-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | W. Hochstattler and J. Wiehe, The Chromatic Polynomial of a Digraph -- J. Dìaz et al., On List k-Coloring Convex Bipartite Graphs -- E. Kubicka et al., Total chromatic sum for trees -- S. Ghosal and S. C. Ghosh, An incremental search heuristic for coloring vertices of a graph -- S. Bandopadhyay et al., Improved Bounds on the Span of L(1,2)-edge Labeling of Some Infinite Regular Grids -- E. Althaus and S. Ziegler, Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm -- H. Kerivin and A. Wagler, On superperfection of edge intersection graphs of paths -- L. Liberti et al., A cycle-based formulation for the Distance Geometry Problem -- P. Samer and D. Haugland, The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope -- Lucas L. S. Portugal et al., Relating hypergraph parameters of generalized power graphs -- A. Nixon, Assur decompositions of direction-length frameworks -- M. Hiller et al., On the Burning Number of p-Caterpillars -- J. Boeckmann and C. Thielen, An Approximation Algorithm for Network Flow Interdiction with Unit Costs and Two Capacities -- T. Bacci and S. Nicoloso, On the benchmark instances for the Bin Packing Problem with Conflicts -- Barbara M. Anthony and Alison M. Marr, Directed Zagreb Indices -- F. Couto et al., Edge Tree Spanners -- S. Khalife, Sequence graphs: characterization and counting of admissible elements -- L. Burahem Martins et al., On solving the time window assignment vehicle routing problem via iterated local search -- M. Barbato et al., Synchronized Pickup and Delivery Problems with Connecting FIFO Stack -- A. Teymourifar et al., A Comparison Between Simultaneous and Hierarchical Approaches to Solve a Multi-Objective Location-Routing Problem -- M. Bodirsky et al., Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables -- M. Cacciola et al., A Lagrangian approach to Chance Constrained Routing with Local Broadcast -- P. Detti et al., A metaheuristic approach for biological sample transportation in healthcare -- Diego M. Pinto and G. Stecca, Optimal Planning of Waste Sorting Operations through Mixed Integer Linear Programming -- G. Micheli et al., Selecting and Initializing Representative Days for Generation and Transmission Expansion Planning with High Shares of Renewables -- T. Bacci et al., Start-up/Shut-down MINLP formulations for the Unit Commitment with Ramp Constraints -- J. Lee et al., Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions -- M. Aprile et al., Recognizing Cartesian products of matrices and polytopes -- A. Frank, Special subclass of Generalized Semi-Markov Decision Processes with discrete time -- R. Seccia et al., Coupling Machine Learning and Integer Programming for Optimal TV Promo Scheduling -- F. Mendoza-Granada and M. Villagra, A Distributed Algorithm for Spectral Sparsification of Graphs with Applications to Data Clustering. |
| Record Nr. | UNISA-996466551003316 |
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graphs and combinatorial optimization : from theory to applications : CTW2020 proceedings / / Claudio Gentile, Giuseppe Stecca, Paolo Ventura, editors
| Graphs and combinatorial optimization : from theory to applications : CTW2020 proceedings / / Claudio Gentile, Giuseppe Stecca, Paolo Ventura, editors |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (XIII, 413 p. 97 illus., 38 illus. in color.) |
| Disciplina | 519.3 |
| Collana | AIRO Springer Series |
| Soggetto topico |
Combinatorial optimization
Optimització combinatòria |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN | 3-030-63072-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | W. Hochstattler and J. Wiehe, The Chromatic Polynomial of a Digraph -- J. Dìaz et al., On List k-Coloring Convex Bipartite Graphs -- E. Kubicka et al., Total chromatic sum for trees -- S. Ghosal and S. C. Ghosh, An incremental search heuristic for coloring vertices of a graph -- S. Bandopadhyay et al., Improved Bounds on the Span of L(1,2)-edge Labeling of Some Infinite Regular Grids -- E. Althaus and S. Ziegler, Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm -- H. Kerivin and A. Wagler, On superperfection of edge intersection graphs of paths -- L. Liberti et al., A cycle-based formulation for the Distance Geometry Problem -- P. Samer and D. Haugland, The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope -- Lucas L. S. Portugal et al., Relating hypergraph parameters of generalized power graphs -- A. Nixon, Assur decompositions of direction-length frameworks -- M. Hiller et al., On the Burning Number of p-Caterpillars -- J. Boeckmann and C. Thielen, An Approximation Algorithm for Network Flow Interdiction with Unit Costs and Two Capacities -- T. Bacci and S. Nicoloso, On the benchmark instances for the Bin Packing Problem with Conflicts -- Barbara M. Anthony and Alison M. Marr, Directed Zagreb Indices -- F. Couto et al., Edge Tree Spanners -- S. Khalife, Sequence graphs: characterization and counting of admissible elements -- L. Burahem Martins et al., On solving the time window assignment vehicle routing problem via iterated local search -- M. Barbato et al., Synchronized Pickup and Delivery Problems with Connecting FIFO Stack -- A. Teymourifar et al., A Comparison Between Simultaneous and Hierarchical Approaches to Solve a Multi-Objective Location-Routing Problem -- M. Bodirsky et al., Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables -- M. Cacciola et al., A Lagrangian approach to Chance Constrained Routing with Local Broadcast -- P. Detti et al., A metaheuristic approach for biological sample transportation in healthcare -- Diego M. Pinto and G. Stecca, Optimal Planning of Waste Sorting Operations through Mixed Integer Linear Programming -- G. Micheli et al., Selecting and Initializing Representative Days for Generation and Transmission Expansion Planning with High Shares of Renewables -- T. Bacci et al., Start-up/Shut-down MINLP formulations for the Unit Commitment with Ramp Constraints -- J. Lee et al., Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions -- M. Aprile et al., Recognizing Cartesian products of matrices and polytopes -- A. Frank, Special subclass of Generalized Semi-Markov Decision Processes with discrete time -- R. Seccia et al., Coupling Machine Learning and Integer Programming for Optimal TV Promo Scheduling -- F. Mendoza-Granada and M. Villagra, A Distributed Algorithm for Spectral Sparsification of Graphs with Applications to Data Clustering. |
| Record Nr. | UNINA-9910482970703321 |
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graphs and Combinatorial Optimization: from Theory to Applications : CTW 2023, Garmisch-Partenkirchen, Germany, June 20–22 / / edited by Andreas Brieden, Stefan Pickl, Markus Siegle
| Graphs and Combinatorial Optimization: from Theory to Applications : CTW 2023, Garmisch-Partenkirchen, Germany, June 20–22 / / edited by Andreas Brieden, Stefan Pickl, Markus Siegle |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (204 pages) |
| Disciplina | 371.33 |
| Collana | AIRO Springer Series |
| Soggetto topico |
Mathematical optimization
Graph theory Computer science - Mathematics Discrete mathematics Optimization Graph Theory Mathematics of Computing Applications of Discrete Mathematics Teoria de grafs Optimització combinatòria |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN | 9783031468261 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On syntactical graphs-of-words -- k-slow Burning: Complexity and Upper Bounds -- Exact approaches for the Connected Vertex Cover problem -- Handling Sub-symmetry in Integer Programming using Activation Handlers -- Online Facility Location: comparing ad-hoc and MIP-based algorithms -- A Multivariate Complexity Analysis of the Generalized Noah’s Ark Problem -- On the Optimality Gap of Full Airport Slot Assignments: Capacity-limited Packing with Pareto Optimality Constraints -- The algorithmic complexity of the Paired Matching problem -- Edge Contraction and Forbidden Induced Subgraphs -- Rigidity of frameworks on spheres -- Discrepancies of subtrees.-Data-driven feasibility for the Resource Constraint Shortest Path Problem.-Monte-Carlo Integration on a Union of Polytopes -- Managing Time Expanded Networks: The Strong Lift Problem. |
| Record Nr. | UNINA-9910841861403321 |
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Integration of Constraint Programming, Artificial Intelligence, and Operations Research : 19th International Conference, CPAIOR 2022, Los Angeles, CA, USA, June 20-23, 2022, Proceedings / / edited by Pierre Schaus
| Integration of Constraint Programming, Artificial Intelligence, and Operations Research : 19th International Conference, CPAIOR 2022, Los Angeles, CA, USA, June 20-23, 2022, Proceedings / / edited by Pierre Schaus |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (459 pages) |
| Disciplina |
006.3
005.116 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science - Mathematics
Artificial intelligence Computer science Computer engineering Computer networks Mathematics of Computing Artificial Intelligence Theory of Computation Computer Engineering and Networks Programació per restriccions Optimització combinatòria Processament de dades |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN |
9783031080111
9783031080104 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Two-Phase Hybrid Approach for the Hybrid Flexible Flowshop with Transportation Times -- A SAT Encoding to compute Aperiodic Tiling Rhythmic Canons -- Transferring Information across Restarts in MIP -- Towards Copeland Optimization in Combinatorial Problems -- Coupling Different Integer Encodings for SAT -- Model-Based Algorithm Configuration with Adaptive Capping and Prior Distributions -- Shattering Inequalities for Learning Optimal Decision Trees -- Learning Pseudo-Backdoors for Mixed Integer Programs -- Leveraging Integer Linear Programming to Learn Optimal Fair Rule Lists -- Solving the Job Shop Scheduling Problem extended with AGVs – Classical and Quantum Approaches -- Stochastic Decision Diagrams -- Improving the robustness of EPS to solve the TSP -- Efficient operations between MDDs and constraints -- Deep Policy Dynamic Programming for Vehicle Routing Problems -- Learning a Propagation Complete Formula -- A FastMap-Based Algorithm for Block Modeling -- Packing by Scheduling: Using Constraint Programming to Solve a Complex 2D Cutting Stock Problem -- Dealing with the product constraint -- Multiple-choice knapsack constraint in graphical models -- A Learning Large Neighborhood Search for the Staff Rerostering Problem -- Practically Uniform Solution Sampling in Constraint Programming -- Training Thinner and Deeper Neural Networks: Jumpstart Regularization -- Hybrid Offline/Online Optimization for Energy Management via Reinforcement Learning -- Enumerated Types and Type Extensions for MiniZinc -- A parallel algorithm for generalized arc-consistent filtering for the Alldifferent constraint -- Analyzing the Reachability Problem in Choice Networks -- Model-based Approaches to Multi-Attribute Diverse Matching. |
| Record Nr. | UNINA-9910574856903321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Introduction to Combinatorial Optimization [[electronic resource] /] / by Ding-Zhu Du, Panos M. Pardalos, Xiaodong Hu, Weili Wu
| Introduction to Combinatorial Optimization [[electronic resource] /] / by Ding-Zhu Du, Panos M. Pardalos, Xiaodong Hu, Weili Wu |
| Autore | Du Dingzhu |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (407 pages) |
| Disciplina | 519.64 |
| Collana | Springer Optimization and Its Applications |
| Soggetto topico |
Mathematical optimization
Computer science Operations research Management science Algorithms Optimization Theory of Computation Operations Research, Management Science Optimització combinatòria |
| Soggetto genere / forma | Llibres electrònics |
| ISBN | 3-031-10596-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Introduction.-2. Divide-and-Conquer -- 3. Dynamic Programming and Shortest Path -- 4. Greedy Algorithm and Spanning Tree -- 5. Incremental Method and Maximum Network Flow -- 6. Linear Programming -- 7. Primal-Dual Methods and Minimum Cost Flow -- 8. NP-hard Problems and Approximation Algorithms -- 9. Restriction and Steiner Tree -- 10. Greedy Approximation and Submodular Optimization -- 11. Relaxation and Rounding. 12. Nonsubmodular Optimization -- Bibliography. |
| Record Nr. | UNISA-996490345703316 |
|
Du Dingzhu
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Introduction to Combinatorial Optimization / / by Ding-Zhu Du, Panos M. Pardalos, Xiaodong Hu, Weili Wu
| Introduction to Combinatorial Optimization / / by Ding-Zhu Du, Panos M. Pardalos, Xiaodong Hu, Weili Wu |
| Autore | Du Dingzhu |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (407 pages) |
| Disciplina | 519.64 |
| Collana | Springer Optimization and Its Applications |
| Soggetto topico |
Mathematical optimization
Computer science Operations research Management science Algorithms Optimization Theory of Computation Operations Research, Management Science Optimització combinatòria |
| Soggetto genere / forma | Llibres electrònics |
| ISBN | 3-031-10596-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Introduction.-2. Divide-and-Conquer -- 3. Dynamic Programming and Shortest Path -- 4. Greedy Algorithm and Spanning Tree -- 5. Incremental Method and Maximum Network Flow -- 6. Linear Programming -- 7. Primal-Dual Methods and Minimum Cost Flow -- 8. NP-hard Problems and Approximation Algorithms -- 9. Restriction and Steiner Tree -- 10. Greedy Approximation and Submodular Optimization -- 11. Relaxation and Rounding. 12. Nonsubmodular Optimization -- Bibliography. |
| Record Nr. | UNINA-9910616395903321 |
|
Du Dingzhu
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
