A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
Kis, Tamás (2005) A branch-and-cut algorithm for scheduling of projects with variable-intensity activities. MATHEMATICAL PROGRAMMING, 103 (3). pp. 515-539.
Full text not available from this repository.Item Type: | Article |
---|---|
Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
Divisions: | Research Laboratory on Engineering & Management Intelligence |
Depositing User: | Eszter Nagy |
Date Deposited: | 11 Dec 2012 15:17 |
Last Modified: | 11 Dec 2012 15:17 |
URI: | https://eprints.sztaki.hu/id/eprint/3958 |
Update Item |