A linear programming and constraint propagation-based lower bound for the RCPSP (Q1590041): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4495168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the resource-constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPLIB -- a project scheduling problem library / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938774 / rank
 
Normal rank

Revision as of 11:19, 3 June 2024

scientific article
Language Label Description Also known as
English
A linear programming and constraint propagation-based lower bound for the RCPSP
scientific article

    Statements

    A linear programming and constraint propagation-based lower bound for the RCPSP (English)
    0 references
    0 references
    0 references
    26 August 2002
    0 references
    scheduling
    0 references
    resource-constrained project scheduling problem
    0 references
    lower bounds
    0 references
    column generation
    0 references
    constraint propagation
    0 references

    Identifiers