http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
Graphs and Combinatorial Optimization: from Theory to Applications
1 online resource (XIII, 413 pages 97 illustrations, 38 illustrations in color.)
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.
W. Hochstattler and J. Wiehe, The Chromatic Polynomial of a Digraph -- J. Dìaz and others, On List k-Coloring Convex Bipartite Graphs -- E. Kubicka and others, Total chromatic sum for trees -- S. Ghosal and S. C. Ghosh, An incremental search heuristic for coloring vertices of a graph -- S. Bandopadhyay and others, 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 and others, 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 and others, Relating hypergraph parameters of generalized power graphs -- A. Nixon, Assur decompositions of direction-length frameworks -- M. Hiller and others, 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 and others, Edge Tree Spanners -- S. Khalife, Sequence graphs: characterization and counting of admissible elements -- L. Burahem Martins and others, On solving the time window assignment vehicle routing problem via iterated local search -- M. Barbato and others, Synchronized Pickup and Delivery Problems with Connecting FIFO Stack -- A. Teymourifar and others, A Comparison Between Simultaneous and Hierarchical Approaches to Solve a Multi-Objective Location-Routing Problem -- M. Bodirsky and others, Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables -- M. Cacciola and others, A Lagrangian approach to Chance Constrained Routing with Local Broadcast -- P. Detti and others, 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 and others, Selecting and Initializing Representative Days for Generation and Transmission Expansion Planning with High Shares of Renewables -- T. Bacci and others, Start-up/Shut-down MINLP formulations for the Unit Commitment with Ramp Constraints -- J. Lee and others, Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions -- M. Aprile and others, Recognizing Cartesian products of matrices and polytopes -- A. Frank, Special subclass of Generalized Semi-Markov Decision Processes with discrete time -- R. Seccia and others, 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.
edited by Claudio Gentile, Giuseppe Stecca, Paolo Ventura.
Engineering Economics, Organization, Logistics, Marketing