A branch-and-cut algorithm for graph coloring (Q2489906): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q337477
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Isabel Méndez-Díaz / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ABACUS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DSATUR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / 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.dam.2005.05.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052435807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods to color the vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the graph coloring polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frozen development in graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using tabu search techniques for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4789079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph coloring algorithm for large scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003439 / 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: Q2741502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pruning Procedure for Exact Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of the set covering polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank

Latest revision as of 13:29, 24 June 2024

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

    Statements

    A branch-and-cut algorithm for graph coloring (English)
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    graph coloring
    0 references
    integer programming
    0 references
    branch-and-cut algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references