A binary-rounding heuristic for multi-period variable-task-duration assignment problems (Q1919790): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Weighted Assignment Models and Their Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Multi-Resource Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource-Constrained Assignment Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics and reduction methods for multiple constraints 0-1 linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Ceiling Point Algorithm for General Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition / rank
 
Normal rank

Latest revision as of 12:43, 24 May 2024

scientific article
Language Label Description Also known as
English
A binary-rounding heuristic for multi-period variable-task-duration assignment problems
scientific article

    Statements

    A binary-rounding heuristic for multi-period variable-task-duration assignment problems (English)
    0 references
    0 references
    0 references
    19 January 1997
    0 references
    multi-period assignment
    0 references
    multiple time periods
    0 references
    three-dimensional assignment
    0 references

    Identifiers