𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem

✍ Scribed by Diego Delle Donne; Javier Marenco

Book ID
113567718
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
472 KB
Volume
8
Category
Article
ISSN
1572-5286

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A branch-and-cut algorithm for partition
A branch-and-cut algorithm for partition coloring
✍ Yuri Frota; Nelson Maculan; Thiago F. Noronha; Celso C. Ribeiro πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 294 KB πŸ‘ 1 views
A branch-and-cut algorithm for the resou
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
✍ Fischetti, Matteo; Vigo, Daniele πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 150 KB πŸ‘ 2 views

In this paper, we present a branch-and-cut algorithm for the exact solution of an NP-hard extension of the well-known Minimum-Weight Arborescence (MWA) problem, in which resource constraints for each node are considered. This Resource-Constrained Minimum-Weight Arborescence (RMWA) problem arises, e.

A branch-and-cut algorithm for the preem
A branch-and-cut algorithm for the preemptive swapping problem
✍ 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