On a Binary-Encoded ILP Coloring Formulation
From MaRDI portal
Publication:2892353
DOI10.1287/ijoc.1060.0178zbMath1241.90087OpenAlexW2074577851MaRDI QIDQ2892353
Publication date: 18 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/90ea095fe872b2fdb138950d73aa4c028a37e1ba
Programming involving graphs or networks (90C35) Integer programming (90C10) Boolean programming (90C09) Coloring of graphs and hypergraphs (05C15)
Related Items
Symmetry in Mathematical Programming, In situ column generation for a cutting-stock problem, A supernodal formulation of vertex colouring with applications in course timetabling, Matrices with lexicographically-ordered rows, Lower bounds on the sizes of integer programs without additional variables, Reformulations in mathematical programming: automatic symmetry detection and exploitation, Solving a multicoloring problem with overlaps using integer programming, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, Mixed Integer Linear Programming Formulation Techniques, Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization, Automatic Generation of Symmetry-Breaking Constraints, Forbidden Vertices, Parsimonious binary-encoding in integer programming
