![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "A Continuous-Time MILP Formulation for the Multi-Mode Resource-Constrained Project Scheduling Problem"
@inproceedings{DBLP:conf/ieem/GnagiRT18, author = {Mario Gn{\"{a}}gi and Tom Rihm and Norbert Trautmann}, title = {A Continuous-Time {MILP} Formulation for the Multi-Mode Resource-Constrained Project Scheduling Problem}, booktitle = {2018 {IEEE} International Conference on Industrial Engineering and Engineering Management, {IEEM} 2018, Bangkok, Thailand, December 16-19, 2018}, pages = {452--456}, year = {2018}, crossref = {DBLP:conf/ieem/2018}, url = {https://doi.org/10.1109/IEEM.2018.8607285}, doi = {10.1109/IEEM.2018.8607285}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ieem/GnagiRT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/ieem/2018, title = {2018 {IEEE} International Conference on Industrial Engineering and Engineering Management, {IEEM} 2018, Bangkok, Thailand, December 16-19, 2018}, publisher = {{IEEE}}, year = {2018}, url = {https://ieeexplore.ieee.org/xpl/conhome/8589962/proceeding}, isbn = {978-1-5386-6786-6}, timestamp = {Sat, 22 Jun 2024 05:15:22 +0200}, biburl = {https://dblp.org/rec/conf/ieem/2018.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.