Cut generation for an employee timetabling problem (Q1042034): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q2779608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4865055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Staff scheduling and rostering: a review of applications, methods and models. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank

Revision as of 05:44, 2 July 2024

scientific article
Language Label Description Also known as
English
Cut generation for an employee timetabling problem
scientific article

    Statements

    Cut generation for an employee timetabling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 December 2009
    0 references
    employee timetabling problem
    0 references
    multi-choice multi-dimensional knapsack problem
    0 references
    Benders decomposition
    0 references

    Identifiers