Algorithms for minclique scheduling problems (Q5961609): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Algorithm for Partitioning the Nodes of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CON due-date determination and sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimization of Completion Time Variance with a Bicriteria Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A user's guide to tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Variation of Flow Time in Single Machine Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the completion time variance minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completion time variance minimization on a single machine is difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projection technique for partitioning the nodes of a graph / rank
 
Normal rank

Latest revision as of 09:50, 27 May 2024

scientific article; zbMATH DE number 981906
Language Label Description Also known as
English
Algorithms for minclique scheduling problems
scientific article; zbMATH DE number 981906

    Statements

    Algorithms for minclique scheduling problems (English)
    0 references
    0 references
    0 references
    0 references
    25 February 1997
    0 references
    spectral algorithms
    0 references
    tabu search
    0 references
    scheduling problems
    0 references
    minimum weighted clique
    0 references
    complete weighted graph
    0 references
    negative weights
    0 references
    self-loops
    0 references

    Identifiers