A branch-and-cut algorithm for partition coloring (Q3057147): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Nelson F. Maculan / rank
 
Normal rank
Property / author
 
Property / author: Celso Carneiro Ribeiro / 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.1002/net.20365 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4243377619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic Scheduling and the Chromatic Number Problem / 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: Separating lifted odd-hole inequalities to solve the index selection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic heuristic for a computationally difficult set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic Orientations with Path Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Airline Crew Scheduling Problems by Branch-and-Cut / 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: Routing and wavelength assignment by partition colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP with path-relinking for private virtual circuit routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems / rank
 
Normal rank

Latest revision as of 12:58, 3 July 2024

scientific article
Language Label Description Also known as
English
A branch-and-cut algorithm for partition coloring
scientific article

    Statements

    A branch-and-cut algorithm for partition coloring (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 November 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    partition coloring
    0 references
    branch and cut
    0 references
    formulation by representatives
    0 references
    0 references