Cut generation for an employee timetabling problem (Q1042034): 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.1016/j.ejor.2008.03.036 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2008.03.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064422611 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2008.03.036 / rank
 
Normal rank

Latest revision as of 14:36, 10 December 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