Simplifying the nonlinear continuous time-cost tradeoff problem (Q1697748): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Zhi-xiong Su / rank
Normal rank
 
Property / author
 
Property / author: Jian-xun Qi / rank
Normal rank
 
Property / author
 
Property / author: Han-ying Wei / rank
Normal rank
 
Property / author
 
Property / author: Zhi-xiong Su / rank
 
Normal rank
Property / author
 
Property / author: Jian-xun Qi / rank
 
Normal rank
Property / author
 
Property / author: Han-ying Wei / 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.1007/s11424-017-5175-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2727796646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network decomposition-based benchmark results for the discrete time-cost tradeoff problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project scheduling. A research handbook. / 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: New computational results for the discrete time/cost trade-off problem with time-switch constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new path-based cutting plane approach for the discrete time-cost tradeoff problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical Path Problems with Concave Cost-Time Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bilinear relaxation based algorithm for concave piecewise linear network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Time Compression in Project Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CPM Time-Cost Computational Algorithm for Arbitrary Activity Cost Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A line search filter secant method for nonlinear equality constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dwindling filter line search algorithm for nonlinear equality constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on time/cost tradeoff curve generation for project scheduling with multi-mode resource availability costs / rank
 
Normal rank

Latest revision as of 04:16, 15 July 2024

scientific article
Language Label Description Also known as
English
Simplifying the nonlinear continuous time-cost tradeoff problem
scientific article

    Statements

    Simplifying the nonlinear continuous time-cost tradeoff problem (English)
    0 references
    20 February 2018
    0 references
    activity floats
    0 references
    CPM networks
    0 references
    operational research
    0 references
    simplification
    0 references
    time-cost tradeoff
    0 references
    0 references
    0 references
    0 references

    Identifiers

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