| TÃtulo : |
Graphs and Combinatorial Optimization: from Theory to Applications : CTW2020 Proceedings |
| Tipo de documento: |
documento electrónico |
| Autores: |
Gentile, Claudio, ; Stecca, Giuseppe, ; Ventura, Paolo, |
| Mención de edición: |
1 ed. |
| Editorial: |
[s.l.] : Springer |
| Fecha de publicación: |
2021 |
| Número de páginas: |
XIII, 413 p. 97 ilustraciones, 38 ilustraciones en color. |
| ISBN/ISSN/DL: |
978-3-030-63072-0 |
| Nota general: |
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. |
| Palabras clave: |
Optimización Investigación de Operaciones y TeorÃa de la Decisión Gestión industrial Matemáticas discretas Investigación operativa Optimización matemática |
| Ãndice Dewey: |
519.6 |
| Resumen: |
Este libro destaca contribuciones nuevas y originales sobre TeorÃa de Grafos y Optimización Combinatoria tanto desde el punto de vista teórico como desde aplicaciones en todos los campos. Los capÃtulos del libro describen modelos y métodos basados ​​en gráficos, propiedades estructurales, optimización discreta, optimización de redes, programación entera mixta, heurÃstica, metaheurÃstica, heurÃstica matemática y métodos exactos, asà como aplicaciones. El libro recopila contribuciones seleccionadas de la conferencia internacional CTW2020 (18.º Taller Colonia-Twente sobre gráficos y optimización combinatoria), celebrada en lÃnea del 14 al 16 de septiembre de 2020. La conferencia fue organizada por IASI-CNR con la contribución de la Universidad de Roma Tre, Universidad Roma Tor Vergata y CNRS-LIX y con el apoyo de AIRO. Está dirigido a investigadores, estudiantes de doctorado y profesionales en los campos de la teorÃa de grafos, las matemáticas discretas, la optimización combinatoria y la investigación de operaciones. |
| Nota de contenido: |
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 Inï¬nite 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 ï¬xed 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 Sparsiï¬cation of Graphs with Applications to Data Clustering. |
| En lÃnea: |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
| Link: |
https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i |
Graphs and Combinatorial Optimization: from Theory to Applications : CTW2020 Proceedings [documento electrónico] / Gentile, Claudio, ; Stecca, Giuseppe, ; Ventura, Paolo, . - 1 ed. . - [s.l.] : Springer, 2021 . - XIII, 413 p. 97 ilustraciones, 38 ilustraciones en color. ISBN : 978-3-030-63072-0 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
| Palabras clave: |
Optimización Investigación de Operaciones y TeorÃa de la Decisión Gestión industrial Matemáticas discretas Investigación operativa Optimización matemática |
| Ãndice Dewey: |
519.6 |
| Resumen: |
Este libro destaca contribuciones nuevas y originales sobre TeorÃa de Grafos y Optimización Combinatoria tanto desde el punto de vista teórico como desde aplicaciones en todos los campos. Los capÃtulos del libro describen modelos y métodos basados ​​en gráficos, propiedades estructurales, optimización discreta, optimización de redes, programación entera mixta, heurÃstica, metaheurÃstica, heurÃstica matemática y métodos exactos, asà como aplicaciones. El libro recopila contribuciones seleccionadas de la conferencia internacional CTW2020 (18.º Taller Colonia-Twente sobre gráficos y optimización combinatoria), celebrada en lÃnea del 14 al 16 de septiembre de 2020. La conferencia fue organizada por IASI-CNR con la contribución de la Universidad de Roma Tre, Universidad Roma Tor Vergata y CNRS-LIX y con el apoyo de AIRO. Está dirigido a investigadores, estudiantes de doctorado y profesionales en los campos de la teorÃa de grafos, las matemáticas discretas, la optimización combinatoria y la investigación de operaciones. |
| Nota de contenido: |
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 Inï¬nite 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 ï¬xed 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 Sparsiï¬cation of Graphs with Applications to Data Clustering. |
| En lÃnea: |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
| Link: |
https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i |
|  |
Hacer una sugerencia Refinar búsquedaGraphs and Combinatorial Optimization: from Theory to Applications / Gentile, Claudio ; Stecca, Giuseppe ; Ventura, Paolo
