Network decomposition-based benchmark results for the discrete time-cost tradeoff problem (Q1772839): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q647536
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Alf Kimms / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2004.04.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998370163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Reduction of Two-Terminal Directed Acyclic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete time-cost tradeoff problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of approximation of the discrete time-cost tradeoff problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal procedures for the discrete time/cost trade-off problem in project networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal design of centralized computer networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Network Flow Computation for Project Cost Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Algorithm for Decision CPM Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical-Path Planning and Scheduling: Mathematical Basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the minimum-dummy-activities problem in a pert network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Solution to Cost-Time Tradeoff for CPM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of the minimum-dummy-activities problem in a pert network / rank
 
Normal rank

Latest revision as of 09:23, 10 June 2024

scientific article
Language Label Description Also known as
English
Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
scientific article

    Statements

    Network decomposition-based benchmark results for the discrete time-cost tradeoff problem (English)
    0 references
    0 references
    0 references
    0 references
    21 April 2005
    0 references
    Project scheduling
    0 references
    Activity network
    0 references
    Time-cost tradeoff
    0 references
    Network decomposition
    0 references
    Column generation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references