An application of randomized minimum cut to the project time/cost tradeoff problem

DOI10.1016/j.amc.2005.04.063zbMath1137.90701OpenAlexW2021381073MaRDI QIDQ2489471

Hassan Taheri, Hamed Reza Tareghian

Publication date: 28 April 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.04.063

zbMATH Keywords

Project managementRandomized minimum cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (1)

A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search

Cites Work

• A Network Flow Computation for Project Cost Curves
• Critical-Path Planning and Scheduling: Mathematical Basis
• Project Management Duration/Resource Tradeoff Analysis: an Application of the Cut Search Approach
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems

This page was built for publication: An application of randomized minimum cut to the project time/cost tradeoff problem