On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications (Q1631662): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-018-0291-9 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-018-0291-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2802715393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral techniques in combinatorial optimization II: applications and computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with precedence constraints and setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Experimental Data for Computational Testing with Machine Scheduling Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of a finite graph by a set of intervals on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the unrelated parallel machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-018-0291-9 / rank
 
Normal rank

Latest revision as of 01:08, 11 December 2024

scientific article
Language Label Description Also known as
English
On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications
scientific article

    Statements

    On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications (English)
    0 references
    0 references
    6 December 2018
    0 references
    interval graph
    0 references
    polyhedral analysis
    0 references
    branch-and-cut
    0 references
    clique
    0 references

    Identifiers