Amanote Research
Register
Sign In
A Branch-And-Cut Algorithm for Partition Coloring
Networks
- United States
doi 10.1002/net.20365
Full Text
Open PDF
Abstract
Available in
full text
Categories
Information Systems
Computer Networks
Hardware
Communications
Architecture
Software
Date
January 1, 2009
Authors
Yuri Frota
Nelson Maculan
Thiago F. Noronha
Celso C. Ribeiro
Publisher
Wiley
Related search
A Branch-And-Cut Algorithm for the Maximum K-Balanced Subgraph of a Signed Graph
Discrete Applied Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
A Fast Algorithm for Equitable Coloring
Combinatorica
Combinatorics
Computational Mathematics
Discrete Mathematics
Max Cut for Random Graphs With a Planted Partition
Combinatorics Probability and Computing
Statistics
Probability
Applied Mathematics
Mathematics
Computational Theory
Theoretical Computer Science
A Hybrid Algorithm for the Robust Graph Coloring Problem
Revista de Matemática: Teoría y Aplicaciones
A Distributed Algorithm for a B-Coloring of a Graph
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Branch-Price-And-Cut Procedure for the Discrete Ordered Median Problem
INFORMS Journal on Computing
Management Science
Computer Science Applications
Information Systems
Operations Research
Software
A Parallel McMc Algorithm for the Balanced Graph Coloring Problem
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Generalized Graph Strict Strong Coloring Algorithm
International Journal of Applied Metaheuristic Computing
Control
Statistics
Probability
Optimization
Decision Sciences
Computational Theory
Simulation
Computer Science Applications
Computational Mathematics
Mathematics
Modeling
