↓ Skip to main content

Graphs and Combinatorial Optimization: from Theory to Applications

Overview of attention for book
Cover of 'Graphs and Combinatorial Optimization: from Theory to Applications'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Chromatic Polynomial of a Digraph
  3. Altmetric Badge
    Chapter 2 On List k-Coloring Convex Bipartite Graphs
  4. Altmetric Badge
    Chapter 3 Total Chromatic Sum for Trees
  5. Altmetric Badge
    Chapter 4 An Incremental Search Heuristic for Coloring Vertices of a Graph
  6. Altmetric Badge
    Chapter 5 Improved Bounds on the Span of L(1, 2)-edge Labeling of Some Infinite Regular Grids
  7. Altmetric Badge
    Chapter 6 Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm
  8. Altmetric Badge
    Chapter 7 On Superperfection of Edge Intersection Graphs of Paths
  9. Altmetric Badge
    Chapter 8 A Cycle-Based Formulation for the Distance Geometry Problem
  10. Altmetric Badge
    Chapter 9 The Unsuitable Neighbourhood Inequalities for the Fixed Cardinality Stable Set Polytope
  11. Altmetric Badge
    Chapter 10 Relating Hypergraph Parameters of Generalized Power Graphs
  12. Altmetric Badge
    Chapter 11 Assur Decompositions of Direction-Length Frameworks
  13. Altmetric Badge
    Chapter 12 On the Burning Number of p-Caterpillars
  14. Altmetric Badge
    Chapter 13 An Approximation Algorithm for Network Flow Interdiction with Unit Costs and Two Capacities
  15. Altmetric Badge
    Chapter 14 On the Benchmark Instances for the Bin Packing Problem with Conflicts
  16. Altmetric Badge
    Chapter 15 Directed Zagreb Indices
  17. Altmetric Badge
    Chapter 16 Edge Tree Spanners
  18. Altmetric Badge
    Chapter 17 Sequence Graphs: Characterization and Counting of Admissible Elements
  19. Altmetric Badge
    Chapter 18 On Solving the Time Window Assignment Vehicle Routing Problem via Iterated Local Search
  20. Altmetric Badge
    Chapter 19 Synchronized Pickup and Delivery Problems with Connecting FIFO Stack
  21. Altmetric Badge
    Chapter 20 A Comparison Between Simultaneous and Hierarchical Approaches to Solve a Multi-Objective Location-Routing Problem
  22. Altmetric Badge
    Chapter 21 Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables
  23. Altmetric Badge
    Chapter 22 A Lagrangian Approach to Chance Constrained Routing with Local Broadcast
  24. Altmetric Badge
    Chapter 23 A Metaheuristic Approach for Biological Sample Transportation in Healthcare
  25. Altmetric Badge
    Chapter 24 Optimal Planning of Waste Sorting Operations Through Mixed Integer Linear Programming
  26. Altmetric Badge
    Chapter 25 Selecting and Initializing Representative Days for Generation and Transmission Expansion Planning with High Shares of Renewables
  27. Altmetric Badge
    Chapter 26 Start-up/Shut-Down MINLP Formulations for the Unit Commitment with Ramp Constraints
  28. Altmetric Badge
    Chapter 27 Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions
  29. Altmetric Badge
    Chapter 29 Special Subclass of Generalized Semi-Markov Decision Processes with Discrete Time
  30. Altmetric Badge
    Chapter 30 Coupling Machine Learning and Integer Programming for Optimal TV Promo Scheduling
  31. Altmetric Badge
    Chapter 31 A Distributed Algorithm for Spectral Sparsification of Graphs with Applications to Data Clustering
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
2 X users
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Graphs and Combinatorial Optimization: from Theory to Applications
Published by
Springer International Publishing, January 2021
DOI 10.1007/978-3-030-63072-0
ISBNs
978-3-03-063071-3, 978-3-03-063072-0
Editors

Claudio Gentile, Giuseppe Stecca, Paolo Ventura

X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users who shared this research output. Click here to find out more about how the information was compiled.