Narrow search
Showing 1 - 5 of 5
Cover Image
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
Hong, Sung-Pil; Chung, Sung-Jin; Park, Bum Hwan - In: Operations research letters 32 (2004) 3, pp. 233-239
Persistent link: https://www.econbiz.de/10006818996
Cover Image
Polynomiality of sparsest cuts with fixed number of sources
Hong, Sung-Pil; Choi, Byung-Cheon - In: Operations research letters 35 (2007) 6, pp. 739-742
Persistent link: https://www.econbiz.de/10007799666
Cover Image
Pure strategy Nash equilibria and the probabilistic prospects of Stackelberg players
Choi, Byung-Cheon; Leung, Joseph Y.-T.; Pinedo, Michael L. - In: Operations research letters 38 (2010) 2, pp. 94-97
Persistent link: https://www.econbiz.de/10008382075
Cover Image
Complexity of a scheduling problem with controllable processing times
Choi, Byung-cheon; Leung, Joseph Y.-t.; Pinedo, Michael - In: Operations research letters 38 (2010) 2, pp. 123-126
Persistent link: https://www.econbiz.de/10003961625
Cover Image
Strong NP-hardness of minimizing total deviation with generalized and periodic due dates
Choi, Byung-Cheon; Min, Yunhong; Park, Myoung-Ju - In: Operations research letters 47 (2019) 5, pp. 433-437
Persistent link: https://www.econbiz.de/10012110608