Integer Programming and Combinatorial Optimization

DOI10.1007/B97946MaRDI QIDQ5712460zbMATH OpenOpenAlexFDO

Authors Jon Lee, François Margot

Publication date 23 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b97946

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Programming involving graphs or networks (90C35)

Recommendations

• On a binary-encoded ILP coloring formulation
• A polyhedral approach to edge coloring
• A comparison of two edge-coloring formulations
• Properties of some ILP formulations of a class of partitioning problems
• Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results

Cited in

(3)

• Parsimonious binary-encoding in integer programming
• On a binary-encoded ILP coloring formulation
• In situ column generation for a cutting-stock problem

This page was built for publication: Integer Programming and Combinatorial Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712460)