05578nam 2200529 450 99646655100331620230421122505.03-030-63072-210.1007/978-3-030-63072-0(CKB)4100000011781505(DE-He213)978-3-030-63072-0(MiAaPQ)EBC6511424(PPN)254723691(EXLCZ)99410000001178150520211008d2021 uy 0engurnn#008mamaatxtrdacontentcrdamediacrrdacarrierGraphs and combinatorial optimization from theory to applications : CTW2020 proceedings /Claudio Gentile, Giuseppe Stecca, Paolo Ventura, editors1st ed. 2021.Cham, Switzerland :Springer,[2021]©20211 online resource (XIII, 413 p. 97 illus., 38 illus. in color.)AIRO Springer Series,2523-7047 ;53-030-63071-4 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.This 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.AIRO Springer Series,2523-7047 ;5Combinatorial optimizationCongressesOptimització combinatòriathubCongressosthubLlibres electrònicsthubCombinatorial optimizationOptimització combinatòria519.3Gentile ClaudioStecca GiuseppeVentura PaoloMiAaPQMiAaPQMiAaPQBOOK996466551003316Graphs and combinatorial optimization1901521UNISA02946oam 2200493I 450 99101549913033211-315-25909-510.4324/9781315259093 (CKB)3710000000965584(MiAaPQ)EBC4758856(OCoLC)973027777(BIP)59823193(BIP)11129884(EXLCZ)99371000000096558420180706e20162013 uy 0engurcnu||||||||rdacontentrdamediardacarrierCounty borough elections in England and Wales, 1919-1938Vol. 4Exeter-Hull a comparative analysis /Sam Davies and Bob MorleyLondon :Routledge,2016.1 online resource (734 pages) illustrations, mapsFirst published 2013 by Ashgate Publishing.1-84014-249-9 1-351-94802-4 Includes bibliographical references and index.1. Exeter -- 2. Gateshead -- 3. Gloucester -- 4. Great Yarmouth -- 5. Grimsby -- 6. Halifax -- 7. Hastings -- 8. Huddersfield -- 9. Hull.These volumes provide an essential comprehensive work of reference for the annual municipal elections that took place each November in the 83 County Boroughs of England and Wales between 1919 and 1938. They also provide an extensive and detailed analysis of municipal politics in the same period, both in terms of the individual boroughs and of aggregate patterns of political behaviour. Being annual, these local election results give the clearest and most authoritative record of how political opinion changed between general elections, especially useful for research into the longer gaps such as 1924-29 and 1935-45, or crisis periods such as 1929-31. They also illuminate the impact of fringe parties such as the Communist Party and the British Union of Fascists, and also such questions as the role of women in politics, the significance of religious and ethnic differentiation and the connection between occupational and class divisions and party allegiance. Analysis at the ward level is particularly useful for socio-spatial studies. A major work of reference, County Borough Elections in England and Wales, 1919-1938 is indispensable for university libraries and local and national record offices. Each volume has approximately 700 pages.Local electionsEnglandStatisticsLocal electionsWalesStatisticsGreat BritainPolitics and government1910-1936Local electionsLocal elections324.942083Davies Sam.1022205Morley Bob(R. E.)1022206MiAaPQMiAaPQMiAaPQBOOK9910154991303321County borough elections in England and Wales, 1919-19382427904UNINA