A Wide Branching Strategy for the Graph Coloring Problem (Q2940061): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2145765528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of local search methods for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple ingredients leading to very efficient heuristics for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-weight stable sets and safe lower bounds for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex coloring problem and its generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on vertex coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Metaheuristic Approach for the Vertex Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for the vertex coloring problem / 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 branch-and-cut algorithm for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigation of some branch and bound strategies for the solution of mixed integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching in branch-and-price: A generic scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear degree extractors and the inapproximability of max clique and chromatic number / rank
 
Normal rank

Latest revision as of 14:13, 9 July 2024

scientific article
Language Label Description Also known as
English
A Wide Branching Strategy for the Graph Coloring Problem
scientific article

    Statements

    A Wide Branching Strategy for the Graph Coloring Problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 January 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph coloring
    0 references
    integer programming
    0 references
    branch-and-price
    0 references
    computational experiments
    0 references
    0 references