Search Results - subject:"computational complexity"

Traceability technology adoption in supply chain networks

Blaettchen, Philippe; Calmon, Andre P.; Hall, Georgina - In: Management science : journal of the Institute for … 71 (2025) 1, pp. 83-102

Persistent link: https://www.econbiz.de/10015409654

On interdicting dense clusters in a network

Zhong, Haonan; Mahdavi Pajouh, Foad; Butenko, Sergiy; … - In: INFORMS journal on computing : JOC ; charting new … 37 (2025) 4, pp. 1069-1086

Persistent link: https://www.econbiz.de/10015453435

Hardness of pricing routes for two-stage stochastic vehicle routing problems with scenarios

Ota, Matheus J.; Fukasawa, Ricardo - In: Operations research 73 (2025) 4, pp. 2177-2187

Persistent link: https://www.econbiz.de/10015445900

The circular balancing problem

Lee, Myungho; Lee, Kangbok; Pinedo, Michael - In: European journal of operational research : EJOR 321 (2025) 1, pp. 41-56

Persistent link: https://www.econbiz.de/10015085394

Algorithms for the global domination problem

Parra Inza, Ernesto; Vakhania, Nodari; Sigarreta … - In: Computers & operations research : an international journal 173 (2025), pp. 1-14

Persistent link: https://www.econbiz.de/10015101024

Deciding the feasibility of a booking in the European gas market is coNP-hard

Thürauf, Johannes - In: Annals of Operations Research 318 (2022) 1, pp. 591-618

We show that deciding the feasibility of a booking ( FB ) in the European entry-exit gas market is coNP-hard if a nonlinear potential-based flow model is used. The feasibility of a booking can be characterized by polynomially many load flow scenarios with maximum potential-difference, which are...

Persistent link: https://www.econbiz.de/10015165584

On the revealed preference analysis of stable aggregate matchings

Demuynck, Thomas; Salman, Umutcan - In: Theoretical Economics 17 (2022) 4, pp. 1651-1682

Echenique, Lee, Shum, and Yenmez (2013) established the testable revealed preference restrictions for stable aggregate matching with transferable (TU) and non-transferable utility (NTU) and for extremal stable matchings. In this paper, we rephrase their restrictions in terms of properties on a...

Persistent link: https://www.econbiz.de/10014536876

On the revealed preference analysis of stable aggregate matchings

Demuynck, Thomas; Salman, Umutcan - In: Theoretical economics : TE ; an open access journal in … 17 (2022) 4, pp. 1651-1682

Echenique, Lee, Shum, and Yenmez (2013) established the testable revealed preference restrictions for stable aggregate matching with transferable and nontransferable utility and for extremal stable matchings. In this paper, we rephrase their restrictions in terms of properties on a corresponding...

Persistent link: https://www.econbiz.de/10013472499

On a reduction for a class of resource allocation problems

Schoot Uiterkamp, Martijn H. H.; Gerards, Marco E. T.; … - In: INFORMS journal on computing : JOC ; charting new … 34 (2022) 3, pp. 1387-1402

Persistent link: https://www.econbiz.de/10013361646

A note on the complexity of the bilevel bottleneck assignment problem

Fischer, Dennis; Muluk, Komal; Woeginger, Gerhard J. - In: 4OR : quarterly journal of the Belgian, French and … 20 (2022) 4, pp. 713-718

Persistent link: https://www.econbiz.de/10013445545