𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Bahiense, Laura; Frota, Yuri; Noronha, Thiago F.; Ribeiro, Celso C.


Book ID
121955924
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
308 KB
Volume
164
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A branch-and-cut algorithm for the preem
✍ Charles Bordenave; Michel Gendreau; G. Laporte πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 247 KB πŸ‘ 1 views

## Abstract In the swapping problem (SP), every vertex of a complete graph may supply and demand an object of a known type. A vehicle of unit capacity starting and ending its tour at an arbitrary vertex is available for carrying objects of given types between vertices. The SP consists of determinin