The maximum-impact coloring polytope (Q2968505): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1111/itor.12265 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2521129005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precoloring extension. I: Interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4950119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A supernodal formulation of vertex colouring with applications in course timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut procedure for the Udine course timetabling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymmetric representatives formulation for the vertex coloring 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: Facets of the graph coloring polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming formulation for a case study in university timetabling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding critical subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe Lower Bounds for Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curriculum based course timetabling: new solutions to Udine benchmark instances / 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: A cutting plane algorithm for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming methods for large-scale practical classroom assignment problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:13, 13 July 2024

scientific article
Language Label Description Also known as
English
The maximum-impact coloring polytope
scientific article

    Statements

    The maximum-impact coloring polytope (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 March 2017
    0 references
    coloring
    0 references
    integer programming
    0 references
    facets
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references