A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem

Guidong Zhu, Jonathan F. Bard, Gang Yu. A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem. INFORMS Journal on Computing, 18(3):377-390, 2006. [doi]

@article{ZhuBY06,
  title = {A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem},
  author = {Guidong Zhu and Jonathan F. Bard and Gang Yu},
  year = {2006},
  doi = {10.1287/ijoc.1040.0121},
  url = {http://dx.doi.org/10.1287/ijoc.1040.0121},
  researchr = {https://researchr.org/publication/ZhuBY06},
  cites = {0},
  citedby = {0},
  journal = {INFORMS Journal on Computing},
  volume = {18},
  number = {3},
  pages = {377-390},
}