Graph Coloring Lower Bounds from Decision Diagrams
From MaRDI portal
Publication:5041761
DOI10.1007/978-3-030-45771-6_31zbMath1503.90081OpenAlexW3017347807MaRDI QIDQ5041761
Publication date: 14 October 2022
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-45771-6_31
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Coloring of graphs and hypergraphs (05C15)
Related Items
Variable ordering for decision diagrams: a portfolio approach, Total coloring and total matching: polyhedra and facets, Column elimination for capacitated vehicle routing problems, Decision Diagrams for Discrete Optimization: A Survey of Recent Advances, Arc flow formulations based on dynamic programming: theoretical foundations and applications, Integer linear programming formulations of the filter partitioning minimization problem, Graph coloring with decision diagrams
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Decision diagrams for optimization
- An exact approach for the vertex coloring problem
- On the application of graph colouring techniques in round-robin sports scheduling
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Graph coloring for air traffic flow management
- Maximum-weight stable sets and safe lower bounds for graph coloring
- New integer linear programming models for the vertex coloring problem
- Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams
- Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation
- Optimization Bounds from Binary Decision Diagrams
- Manipulating MDD Relaxations for Combinatorial Optimization
- Graph-Based Algorithms for Boolean Function Manipulation
- Binary Decision Diagrams
- New methods to color the vertices of a graph
- A Column Generation Approach for Graph Coloring
- Branching Programs and Binary Decision Diagrams
- A technique for colouring a graph applicable to large scale timetabling problems
- Chromatic Scheduling and the Chromatic Number Problem
