✦ LIBER ✦

An exact DSatur-based algorithm for the Equitable Coloring Problem

✍ Scribed by Méndez-Díaz, Isabel; Nasini, Graciela; Severín, Daniel

Book ID: 122312985
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 206 KB
Volume: 44
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2013.10.044

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new DSATUR-based algorithm for exact v

A new DSATUR-based algorithm for exact vertex coloring

✍ Pablo San Segundo 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 336 KB

An exact algorithm with learning for the

An exact algorithm with learning for the graph coloring problem

✍ Zhou, Zhaoyang; Li, Chu-Min; Huang, Chong; Xu, Ruchu 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 547 KB

An exact approach for the Vertex Colorin

An exact approach for the Vertex Coloring Problem

✍ Enrico Malaguti; Michele Monaci; Paolo Toth 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 458 KB

A branch-and-cut algorithm for the equit

A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives

✍ Bahiense, Laura; Frota, Yuri; Noronha, Thiago F.; Ribeiro, Celso C. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 308 KB

An exact algorithm for the concave trans

An exact algorithm for the concave transportation problem

✍ Leon Cooper; Mary W. Cooper 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 810 KB

## AbstractAn exact method for solving a class of concave transportation problems which reflect economies of scale is presented. By exploiting concepts of dynamic programming and an analysis of the nature of the recursion, an analytic representation of the optimal allocation at each stage has been

An exact algorithm for the maximum cliqu

An exact algorithm for the maximum clique problem

✍ Randy Carraghan; Panos M. Pardalos 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 358 KB