Linear programming formulation of the vertex colouring problem

DOI10.1504/IJMOR.2010.032718zbMATH Open1188.90168OpenAlexW2165814090MaRDI QIDQ975796FDOQ975796

Moustapha Diaby

Publication date: 11 June 2010

Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijmor.2010.032718

zbMATH Keywords

computational complexitylinear programmingcombinatorial optimisationgraph colouringvertex colouringbipartite network flowgraph-based modellingvertex packing

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27)

Cited In (1)

• Homogeneous grouping of non-prime steel products for online auctions: a case study

   Recommendations

• New integer linear programming models for the vertex coloring problem 👍 👎
• Fractional programming formulation for the vertex coloring problem 👍 👎
• An exact approach for the vertex coloring problem 👍 👎
• Linear programming formulation of the set partitioning problem 👍 👎
• A survey on vertex coloring problems 👍 👎

This page was built for publication: Linear programming formulation of the vertex colouring problem

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