001434831 000__ 06287cam\a2200601\i\4500
001434831 001__ 1434831
001434831 003__ OCoLC
001434831 005__ 20230309003821.0
001434831 006__ m\\\\\o\\d\\\\\\\\
001434831 007__ cr\cn\nnnunnun
001434831 008__ 210313s2021\\\\sz\\\\\\o\\\\\100\0\eng\d
001434831 019__ $$a1240380999
001434831 020__ $$a3030630722$$q(electronic book)
001434831 020__ $$a9783030630720$$q(electronic bk.)
001434831 020__ $$z9783030630713$$q(print)
001434831 020__ $$z3030630714
001434831 0247_ $$a10.1007/978-3-030-63072-0$$2doi
001434831 035__ $$aSP(OCoLC)1241451200
001434831 040__ $$aEBLCP$$beng$$erda$$epn$$cEBLCP$$dGW5XE$$dYDX$$dOCLCO$$dEBLCP$$dYDXIT$$dOCLCF$$dUKAHL$$dOCLCA$$dOCLCQ$$dOCLCO$$dCOM$$dOCLCO$$dN$T$$dOCLCQ
001434831 049__ $$aISEA
001434831 050_4 $$aQA166$$b.C55 2020
001434831 08204 $$a511/.5$$223
001434831 1112_ $$aCologne-Twente Workshop on Graphs and Combinatorial Optimization$$n(18th :$$d2020 :$$cOnline)
001434831 24510 $$aGraphs and combinatorial optimization :$$bfrom theory to applications : CTW2020 Proceedings /$$cClaudio Gentile, Giuseppe Stecca, Paolo Ventura, editors.
001434831 2463_ $$aCTW 2020
001434831 264_1 $$aCham :$$bSpringer,$$c[2021]
001434831 300__ $$a1 online resource (408 pages)
001434831 336__ $$atext$$btxt$$2rdacontent
001434831 337__ $$acomputer$$bc$$2rdamedia
001434831 338__ $$aonline resource$$bcr$$2rdacarrier
001434831 4901_ $$aAIRO Springer series ;$$vv. 5
001434831 5050_ $$aW. Hochstattler and J. Wiehe, The Chromatic Polynomial of a Digraph -- J. Diaz 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 Innite 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 Conicts -- 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 Sparsication of Graphs with Applications to Data Clustering.
001434831 506__ $$aAccess limited to authorized users.
001434831 520__ $$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.
001434831 588__ $$aOnline resource; title from digital title page (viewed on April 03, 2021).
001434831 650_0 $$aGraph theory$$vCongresses.
001434831 650_0 $$aCombinatorial optimization$$vCongresses.
001434831 650_6 $$aOptimisation combinatoire$$vCongrès.
001434831 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001434831 655_7 $$aConference papers and proceedings.$$2lcgft
001434831 655_7 $$aActes de congrès.$$2rvmgf
001434831 655_0 $$aElectronic books.
001434831 7001_ $$aGentile, Claudio.
001434831 7001_ $$aStecca, Giuseppe.
001434831 7001_ $$aVentura, Paolo.
001434831 77608 $$iPrint version:$$aGentile, Claudio.$$tGraphs and Combinatorial Optimization: from Theory to Applications.$$dCham : Springer International Publishing AG, ©2021$$z9783030630713
001434831 830_0 $$aAIRO Springer series ;$$vv. 5.
001434831 852__ $$bebk
001434831 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-63072-0$$zOnline Access$$91397441.1
001434831 909CO $$ooai:library.usi.edu:1434831$$pGLOBAL_SET
001434831 980__ $$aBIB
001434831 980__ $$aEBOOK
001434831 982__ $$aEbook
001434831 983__ $$aOnline
001434831 994__ $$a92$$bISE