{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T19:34:34Z","timestamp":1777059274139,"version":"3.51.4"},"reference-count":53,"publisher":"EDP Sciences","license":[{"start":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T00:00:00Z","timestamp":1614643200000},"content-version":"vor","delay-in-days":60,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"funder":[{"DOI":"10.13039\/501100004410","name":"Scientific and Technological Research Council of Turkey","doi-asserted-by":"crossref","award":["214M196"],"award-info":[{"award-number":["214M196"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2019,9,6]]},"published-print":{"date-parts":[[2021]]},"abstract":"<jats:p>There are two opponents in a classic network interdiction problem, network owner\/defender and interdictor\/attacker. Each side has enough information about the other\u2019s possible courses of action. While the network user wishes to run the network in an optimal way, the attacker with the limited resources tries to prevent the optimal operation of the network by interdicting the arcs\/nodes of the network. In this study, we investigate project management in a competitive environment using a network interdiction approach. We assume that the project owner\/manager strives to minimize the completion time of a Critical Path Method (CPM) based project while an opponent attempts to maximize the minimum completion time by inflicting some delays on project activities with available interdiction resources. Considering both discrete and continuous delay times, we develop two bi-level mixed-integer programming models for the interdictor. Using duality, we then convert the bi-level models to standard single-level models, which are solvable through standard optimization packages. We extend these models to find efficient solutions in terms of project completion time and interdiction resources from the interdictor\u2019s perspective. In this respect, we develop an algorithm to find an efficient solution set for the interdictor. Next, from project manager\u2019s standpoint, we discuss the earliest and latest scheduling times of activities in case of interdiction. Finally, we apply the developed techniques in a marketing project aiming at introducing a new product. The findings may enhance a better project management in an environment where an opponent can adversely affect the project management process by delaying some activities.<\/jats:p>","DOI":"10.1051\/ro\/2019089","type":"journal-article","created":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T18:52:12Z","timestamp":1568055132000},"page":"S365-S384","source":"Crossref","is-referenced-by-count":2,"special_numbering":"Supplement","title":["Project management in a competitive environment: interdicting a CPM based project and its implications"],"prefix":"10.1051","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5818-9342","authenticated-orcid":false,"given":"Fatih","family":"Kasimo\u011flu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0130brahim","family":"Akg\u00fcn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2021,3,2]]},"reference":[{"key":"R1","unstructured":"Ahuja R.K., Magneti T.L. and Orlin J.B., Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New Jersey (1993)."},{"key":"R2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.ejor.2010.12.011","volume":"211","author":"Akg\u00fcn","year":"2011","journal-title":"Eur. J. Oper. Res."},{"key":"R3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0377-2217(91)90253-R","volume":"51","author":"Anandalingam","year":"1991","journal-title":"Eur. J. Oper. Res."},{"key":"R4","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/0010-4825(87)90060-6","volume":"17","author":"Assimakopoulos","year":"1987","journal-title":"Comput. Biol. Med."},{"key":"R5","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.apm.2011.12.013","volume":"37","author":"Ashtiani","year":"2013","journal-title":"Appl. Math. Model."},{"key":"R6","unstructured":"Bazaraa M.S., Jarvus J.J. and Sherali H.D., Linear Programming and Network Flows. John Wiley & Sons, New Jersey (2005)."},{"key":"R7","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.orl.2015.11.005","volume":"44","author":"Bertsimas","year":"2016","journal-title":"Oper. Res. Lett."},{"key":"R8","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1287\/opre.1050.0231","volume":"53","author":"Brown","year":"2005","journal-title":"Oper. Res."},{"key":"R9","doi-asserted-by":"crossref","unstructured":"Brown G., Carlyle M., Royset J. and Wood R.K., On the complexity of delaying an adversary\u2019s project. In: The Next Wave in Computing, Optimization and Decision Technologies. Springer, New York (2005) 3\u201317.","DOI":"10.1007\/0-387-23529-9_1"},{"key":"R10","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1287\/inte.1060.0252","volume":"36","author":"Brown","year":"2006","journal-title":"Interfaces"},{"key":"R11","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1287\/opre.1080.0643","volume":"57","author":"Brown","year":"2009","journal-title":"Oper. Res."},{"key":"R12","doi-asserted-by":"crossref","first-page":"430243","DOI":"10.1155\/2014\/430243","volume":"2014","author":"Camacho-Vallejo","year":"2014","journal-title":"Math. Prob. Eng."},{"key":"R13","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1002\/net.21739","volume":"69","author":"Chestnut","year":"2017","journal-title":"Networks"},{"key":"R14","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1111\/j.1467-8306.2004.00410.x","volume":"94","author":"Church","year":"2004","journal-title":"Ann. Assoc. Am. Geographers"},{"key":"R15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0167-6377(82)90020-7","volume":"1","author":"Corley","year":"1982","journal-title":"Oper. Res. Lett."},{"key":"R16","unstructured":"Cormican K.J., Computational methods for deterministic and stochastic network interdiction problems. Masters thesis. Naval Post Graduate School, Monterey, CA (1995)."},{"key":"R17","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1287\/opre.46.2.184","volume":"46","author":"Cormican","year":"1998","journal-title":"Oper. Res."},{"key":"R18","unstructured":"Disser Y. and Matuschke J., The complexity of computing a robust flow. Preprint arXiv:1704.08241 (2017)."},{"key":"R19","first-page":"837919","volume":"2013","author":"Fang","year":"2013","journal-title":"Math. Prob. Eng."},{"key":"R20","doi-asserted-by":"crossref","unstructured":"Ford L.R. and Fulkerson D.R., Flows in Networks. Princton University, Princton, NJ (1962).","DOI":"10.1515\/9781400875184"},{"key":"R21","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/BF01584329","volume":"13","author":"Fulkerson","year":"1977","journal-title":"Math. Prog."},{"key":"R22","unstructured":"GAMS Development Corporation, General Algebraic Modeling System (GAMS). Rev 146 (2006)."},{"key":"R23","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/nav.3800180103","volume":"18","author":"Ghare","year":"1971","journal-title":"Nav. Res. Logist. Q."},{"key":"R24","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1002\/nav.3800250412","volume":"25","author":"Golden","year":"1978","journal-title":"Nav. Res. Logist. Q."},{"key":"R25","unstructured":"Helmbold R.L., A Counter Capacity Network Interdiction Model. Report R-611-PR, RAND Corporation: Santa Monica, CA (1971)."},{"key":"R26","unstructured":"Israeli E., System interdiction and defense. Doctoral dissertation Naval Postgraduate School, Monterey, CA (1999)."},{"key":"R27","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.10039","volume":"40","author":"Israeli","year":"2002","journal-title":"Networks"},{"key":"R28","unstructured":"Janjarassuk U. and Nakrachata-Amon T., A simulated annealing algorithm to the stochastic network interdiction problem. In: Proceedings of IEEE International Conference on Industrial Engineering and Engineering Management (2016) 230\u2013233."},{"key":"R29","first-page":"1","volume":"2","author":"Kalashnikov","year":"2015","journal-title":"Math. Prob. Eng."},{"key":"R30","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1109\/TNSE.2016.2587484","volume":"3","author":"Kim","year":"2016","journal-title":"IEEE Trans. Network Sci. Eng."},{"key":"R31","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1002\/nav.3800180408","volume":"17","author":"Lubore","year":"1971","journal-title":"Nav. Res. Logist. Q."},{"key":"R32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2017.07.044","volume":"266","author":"Lusby","year":"2018","journal-title":"Eur. J. Oper. Res."},{"key":"R33","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0167-6377(89)90065-5","volume":"8","author":"Malik","year":"1989","journal-title":"Oper. Res. Lett."},{"key":"R34","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/nav.3800170302","volume":"17","author":"McMasters","year":"1970","journal-title":"Nav. Res. Logist. Q."},{"key":"R35","unstructured":"Meredith J.R. and Mantel S.J., Project management: a managerial approach. John Wiley & Sons, Inc., New Jersey (2003)."},{"key":"R36","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1287\/mnsc.21.5.531","volume":"21","author":"Ratliff","year":"1975","journal-title":"Manage. Sci."},{"key":"R37","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.cie.2010.04.004","volume":"59","author":"Rocco","year":"2010","journal-title":"Comput. Ind. Eng."},{"key":"R38","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1287\/ijoc.1060.0191","volume":"19","author":"Royset","year":"2007","journal-title":"INFORMS J. Comput."},{"key":"R39","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1109\/TPWRS.2004.825888","volume":"19","author":"Salmer\u00f2n","year":"2004","journal-title":"IEEE Trans. Power Syst."},{"key":"R40","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/TPWRS.2008.2004825","volume":"24","author":"Salmer\u00f2n","year":"2009","journal-title":"IEEE Trans. Power Syst."},{"key":"R41","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/BF00935665","volume":"11","author":"Simaan","year":"1973","journal-title":"J. Optim. Theory App."},{"key":"R42","doi-asserted-by":"crossref","unstructured":"Smith J.C., Basic interdiction models. In: Wiley Encyclopedia of Operations Research and Management Science. John Wiley & Sons, Hoboken (2011).","DOI":"10.1002\/9780470400531.eorms0089"},{"key":"R43","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1002\/net.21806","volume":"71","author":"Sundar","year":"2018","journal-title":"Networks"},{"key":"R44","unstructured":"Tabucanon M.T., Multiple Criteria Decision Making in Industry. Elsevier, Amsterdam (1988)."},{"key":"R45","unstructured":"Von Stackelberg H., The Theory of the Market Economy. William Hodge & Co., London, German (1952)."},{"key":"R46","doi-asserted-by":"crossref","first-page":"29332","DOI":"10.1109\/ACCESS.2018.2838570","volume":"6","author":"Wei","year":"2018","journal-title":"IEEE Access"},{"key":"R47","first-page":"125","volume":"42","author":"Wen","year":"1991","journal-title":"J. Oper. Res. Soc."},{"key":"R48","unstructured":"Winston W.L., Operations Research Applications and Algorithms. Brooks\/Cole, Cengage Learning, Belmont (2004)."},{"key":"R49","unstructured":"Wollmer R., Some Methods for Determining the Most Vital Link in a Railway Network. Rand Corporation, Santa Monica, CA (1963)."},{"key":"R50","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1287\/opre.12.6.934","volume":"12","author":"Wollmer","year":"1964","journal-title":"Oper. Res."},{"key":"R51","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0895-7177(93)90236-R","volume":"17","author":"Wood","year":"1993","journal-title":"Math. Comput. Model."},{"key":"R52","doi-asserted-by":"crossref","unstructured":"Wood R.K., Bi-level network interdiction models: formulations and solutions. In: Wiley Encyclopedia of Operations Research and Management Science. John Wiley & Sons, Hoboken (2011).","DOI":"10.1002\/9780470400531.eorms0932"},{"key":"R53","first-page":"1","volume":"67","author":"Zhang","year":"2016","journal-title":"J. Global Optim."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2019089\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T09:31:59Z","timestamp":1617183119000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2019089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":53,"alternative-id":["ro190060"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2019089","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}