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.
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
Opac: Controlla la disponibilità qui
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
Opac: Controlla la disponibilità qui
A View of Operations Research Applications in Italy, 2018 / / edited by Mauro Dell'Amico, Manlio Gaudioso, Giuseppe Stecca
A View of Operations Research Applications in Italy, 2018 / / edited by Mauro Dell'Amico, Manlio Gaudioso, Giuseppe Stecca
Edizione [1st ed. 2019.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica 1 online resource (XIII, 217 p. 78 illus., 51 illus. in color.)
Disciplina 519.6
Collana AIRO Springer Series
Soggetto topico Operations research
Management science
Application software
Applied mathematics
Engineering mathematics
Business logistics
Production management
Operations Research, Management Science
Computer Applications
Applications of Mathematics
Supply Chain Management
Production
Logistics
ISBN 3-030-25842-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Part I - Logistics: 1 M. Bué et al., A two-phase approach for an integrated order batching and picker routing problem -- 2 T. Parriani et al., Creation of Optimal Service Zones for the Delivery of Express Packages.-3 L. Di Puglia Pugliese et al., Solving a three-dimensional bin-packing problem arising in the groupage process: application to the port of Gioia Tauro -- 4 T. Bacci et al., A new software system for optimizing the operations at a container terminal -- Part II - Product Design: 5 A. Credo et al., Design optimization of synchronous reluctance motor for low torque ripple -- 6 G. De Tommasi, A variant of the generalized assignment problem for reliable allocation of sensor measurements in a diagnostic system -- Part III - Production Planning and Scheduling: 7 L. Bertazzi and F. Maggioni, Forecasting Methods and Optimization Models for the Inventory Management of Perishable Products: the Case of “La Centrale del Latte di Vicenza SpA” -- 8 G. Giallombardo et al., Production scheduling and distribution planning at FATER S.p.A. -- Part IV - Social Applications: 9 C. Arbib et al., IoT Flows: A Network Flow Model Application to Building Evacuation -- 10 M. Gentili et al., From Pallets to Puppies: Using Insights from Logistics to Save Animals -- 11 L. Lampariello, Improving social assistance services for minors and disabled people by using multiobjective programming -- Part V – Transportation: 12 E. Fadda et al., An algorithm for the optimal waste collection in urban areas -- 13 M. Dell’Amico et al., A decision support system for earthwork activities in construction logistics -- 14 D. Ambrosino et al., A comparison of optimization models to evaluate the impact of fuel costs when designing new cruise itineraries -- 15 C. Ciancio et al., An Integrated Algorithm for Shift Scheduling Problems for Local Public Transport Companies -- 16 S. Carosi et al., A Tool for Practical Integrated Time-Table Design and Vehicle Scheduling in Public Transport Systems.
Record Nr. UNINA-9910349320903321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui