A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows (Q1342100): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0305-0548(94)90014-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007606891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The payment scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search Applied to the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of a tabu search adaptation to the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth Packing: A Tabu Search Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for graph partitioning / rank
 
Normal rank

Latest revision as of 10:19, 23 May 2024

scientific article
Language Label Description Also known as
English
A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows
scientific article

    Statements

    A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows (English)
    0 references
    0 references
    0 references
    11 January 1995
    0 references
    resource constrained project scheduling
    0 references
    discounted cash flows
    0 references
    tabu search
    0 references
    heuristic
    0 references
    near-optimal solutions
    0 references

    Identifiers