LEADER 05578nam 2200529 450 001 996466551003316 005 20230421122505.0 010 $a3-030-63072-2 024 7 $a10.1007/978-3-030-63072-0 035 $a(CKB)4100000011781505 035 $a(DE-He213)978-3-030-63072-0 035 $a(MiAaPQ)EBC6511424 035 $a(PPN)254723691 035 $a(EXLCZ)994100000011781505 100 $a20211008d2021 uy 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aGraphs and combinatorial optimization $efrom theory to applications : CTW2020 proceedings /$fClaudio Gentile, Giuseppe Stecca, Paolo Ventura, editors 205 $a1st ed. 2021. 210 1$aCham, Switzerland :$cSpringer,$d[2021] 210 4$d©2021 215 $a1 online resource (XIII, 413 p. 97 illus., 38 illus. in color.) 225 1 $aAIRO Springer Series,$x2523-7047 ;$v5 311 $a3-030-63071-4 327 $aW. 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 Con?icts -- 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. 330 $aThis book highlights new and original contributions on Graph Theory and Combinatorial Optimization both from the theoretical point of view and from applications in all fields. The book chapters describe models and methods based on graphs, structural properties, discrete optimization, network optimization, mixed-integer programming, heuristics, meta-heuristics, math-heuristics, and exact methods as well as applications. The book collects selected contributions from the CTW2020 international conference (18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization), held online on September 14-16, 2020. The conference was organized by IASI-CNR with the contribution of University of Roma Tre, University Roma Tor Vergata, and CNRS-LIX and with the support of AIRO. It is addressed to researchers, PhD students, and practitioners in the fields of Graph Theory, Discrete Mathematics, Combinatorial Optimization, and Operations Research. 410 0$aAIRO Springer Series,$x2523-7047 ;$v5 606 $aCombinatorial optimization$vCongresses 606 $aOptimització combinatòria$2thub 608 $aCongressos$2thub 608 $aLlibres electrònics$2thub 615 0$aCombinatorial optimization 615 7$aOptimització combinatòria 676 $a519.3 702 $aGentile$b Claudio 702 $aStecca$b Giuseppe 702 $aVentura$b Paolo 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466551003316 996 $aGraphs and combinatorial optimization$91901521 997 $aUNISA