Local search methods for the discrete time/resource trade-off problem in project networks
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6750(199809)45:6<553::AID-NAV2>3.0.CO;2-1" /><553::AID-NAV2>3.0.CO;2-1 10.1002/(SICI)1520-6750(199809)45:6<553::AID-NAV2>3.0.CO;2-1zbMath0948.90065OpenAlexW1964429546MaRDI QIDQ4255025
De Reyck, Bert, Erik L. Demeulemeester, Willy S. Herroelen
Publication date: 2 November 1999
Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199809)45:6<553::aid-nav2>3.0.co;2-1
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Search theory (90B40) Deterministic scheduling theory in operations research (90B35)
Related Items (15)
This page was built for publication: Local search methods for the discrete time/resource trade-off problem in project networks