Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Linear programming formulation of the vertex colouring problem
Home
Publications
Linear programming formulation of the vertex colouring problem
Linear programming formulation of the vertex colouring problem
Author:
MD
Moustapha Diaby
Moustapha Diaby
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Publisher website
Google Scholar
1 January 2010
journal article
Published by
Inderscience Publishers
in
International Journal of Mathematics in Operational Research
Vol. 2
(3)
,
259
DOI:
10.1504/ijmor.2010.032718
Abstract
In this paper, we present a first linear programming (LP) formulation of the vertex colouring problem (VCP). The complexity orders of the number of variables and the number of constraints of the proposed LP are O (δ
Keywords
INDERSCIENCE
PUBLISHERS
JOURNALS
ACADEMIC
SCIENTIFIC
MANAGEMENT
BUSINESS
CONFERENCE
ARTICLE
PUBLICATION
Related articles
Cited
Cited by 13 articles
Scroll to top