A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (Q408371): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disopt.2011.05.003 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CALMA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2011.05.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039313449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and solution techniques for frequency assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cliques, holes and the vertex coloring polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Approach for Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation and branch-and-cut algorithm for the channel assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum to ``Comparison of column generation models for channel assignment in cellular networks'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISOPT.2011.05.003 / rank
 
Normal rank

Latest revision as of 16:42, 9 December 2024

scientific article
Language Label Description Also known as
English
A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
scientific article

    Statements

    Identifiers