Decision CPM: Network Reduction and Solution

DOI10.1057/JORS.1970.93zbMATH Open0304.90042OpenAlexW4230047073MaRDI QIDQ4060686FDOQ4060686

Authors: Wallace B. Crowston 

Publication date: 1970

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/47233

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Integer programming (90C10)

Cited In (8)

• Simulated annealing and tabu search for multi-mode project payment scheduling
• Controlled alternative activity networks for project management
• The discrete time-cost tradeoff problem revisited
• A graph-based constraint programming approach for the integrated process planning and scheduling problem
• A new path-based cutting plane approach for the discrete time-cost tradeoff problem
• New computational results for the discrete time/cost trade-off problem with time-switch constraints
• The discrete time/cost trade-off problem: Extensions and heuristic procedures
• A new approach for solving the network problems

This page was built for publication: Decision CPM: Network Reduction and Solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4060686)