On a binary-encoded ILP coloring formulation
From MaRDI portal
Recommendations
- Integer Programming and Combinatorial Optimization
- A polyhedral approach to edge coloring
- Properties of some ILP formulations of a class of partitioning problems
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
- ILP models and column generation for the minimum sum coloring problem
Cited in
(15)- Properties of some ILP formulations of a class of partitioning problems
- Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization
- Matrices with lexicographically-ordered rows
- Parsimonious binary-encoding in integer programming
- Mixed integer linear programming formulation techniques
- Symmetry in mathematical programming
- Forbidden vertices
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Automatic Generation of Symmetry-Breaking Constraints
- Integer Programming and Combinatorial Optimization
- A supernodal formulation of vertex colouring with applications in course timetabling
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Exploiting symmetries in optimal quantum circuit design
- In situ column generation for a cutting-stock problem
- Solving a multicoloring problem with overlaps using integer programming
This page was built for publication: On a binary-encoded ILP coloring formulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892353)
