A min-flow algorithm for Minimal Critical Set detection in Resource Constrained Project Scheduling

Artificial Intelligence 182-183 (C):58-67 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,323

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A STUDY ON CLOUD COMPUTING EFFICIENT JOB SCHEDULING ALGORITHMS.Shyam P. Sunder, S. V. Poranki Shekar & Marri Shiva - 2018 - International Journal of Research and Analytical Reviews 5 (2).
Overlapping Community Detection in Dynamic Networks.Nathan Aston - 2014 - Journal of Software Engineering and Applications 7:872-882.
Algorithms for computing minimal conflicts.S. Luan, L. Magnani & G. Dai - 2006 - Logic Journal of the IGPL 14 (2):391--406.

Analytics

Added to PP
2020-12-22

Downloads
1 (#1,905,004)

6 months
1 (#1,478,456)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

References found in this work

Temporal constraint networks.Rina Dechter, Itay Meiri & Judea Pearl - 1991 - Artificial Intelligence 49 (1-3):61-95.

Add more references