scientific article; zbMATH DE number 7529517
From MaRDI portal
Publication:5077804
zbMath1489.90036MaRDI QIDQ5077804
Marcin Anholcer, Helena Gaspars-Wieloch
Publication date: 20 May 2022
Full work available at URL: https://ord.pwr.edu.pl/Issues/2011/vol21/p175
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
networkcritical pathaccuracy of an algorithmproject compression timetime-cost curvestime-cost trade-off analysis
Cites Work
- The discrete time-cost tradeoff problem revisited
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
- A Network Flow Computation for Project Cost Curves
- Critical-Path Planning and Scheduling: Mathematical Basis
- Note—A Note on “A Simple CPM Time-Cost Tradeoff Algorithm”
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- A CPM Time-Cost Computational Algorithm for Arbitrary Activity Cost Functions
- Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept
- A Dynamic Programming Algorithm for Decision CPM Networks
- Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
- A Simple CPM Time-Cost Tradeoff Algorithm
- Critical Path Problems with Concave Cost-Time Curves
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
