A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints

From MaRDI portal

(Redirected from A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=A_partition-based_branch-and-bound_algorithm_for_the_project_duration_problem_with_partially_renewable_resources_and_general_temporal_constraints&oldid=71417484"