The clique problem with multiple-choice constraints under a cycle-free dependency graph (Q2192065): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2019.12.015 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2019.12.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3001605797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent systems of representatives in weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hall's theorem for hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Staircase compatibility and its applications in scheduling and piecewise linearization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nominal and robust train timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm for weighted stable sets in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating orientation and alternating colouration of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting all maximum cliques with a stable set using lopsided independent transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Investigation of Piecewise Linearized Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding \(k\)-cliques in \(k\)-partite graphs / 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: Instantaneous Power Peak Reduction and Train Scheduling Desynchronization in Subway Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Review of energy-efficient train control and timetabling / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126288572 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2019.12.015 / rank
 
Normal rank

Latest revision as of 10:22, 17 December 2024

scientific article
Language Label Description Also known as
English
The clique problem with multiple-choice constraints under a cycle-free dependency graph
scientific article

    Statements

    The clique problem with multiple-choice constraints under a cycle-free dependency graph (English)
    0 references
    0 references
    0 references
    0 references
    29 June 2020
    0 references
    clique problem
    0 references
    multiple-choice constraints
    0 references
    perfect graph
    0 references
    convex-hull description
    0 references
    scheduling
    0 references

    Identifiers

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