Graphs and Combinatorial Optimization: from Theory to Applications CTW2020 Proceedings

Graphs and Combinatorial Optimization: from Theory to Applications CTW2020 Proceedings /

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 optimiz...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Gentile, Claudio (Editor), Stecca, Giuseppe (Editor), Ventura, Paolo (Editor)
Format: Electronic eBook
Language:English
Published: Cham : Springer International Publishing : Imprint: Springer, 2021.
Edition:1st ed. 2021.
Series:AIRO Springer series ; 5.
Subjects:
Mathematical optimization.
Operations research.
Decision making.
Combinatorial analysis.
Engineering economy.
Online Access:Full text (Wentworth users only)
Table of Contents:
  • 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.

Similar Items