Narrow search
Showing 1 - 9 of 9
Cover Image
Approximate formulations for 0-1 knapsack sets
Bienstock, Daniel - In: Operations research letters 36 (2008) 3, pp. 317-320
Persistent link: https://www.econbiz.de/10003773790
Cover Image
Histogram models for robust portfolio optimization
Bienstock, Daniel - In: The journal of computational finance 11 (2007/08) 1, pp. 1-64
Persistent link: https://www.econbiz.de/10003643418
Cover Image
Minimum cost capacity installation for multicommodity network flows
Bienstock, Daniel (contributor) - 1995
Persistent link: https://www.econbiz.de/10000918215
Cover Image
Optimizing resource acquisition decisions by stochastic programming
Bienstock, Daniel - In: Management science : journal of the Institute for … 34 (1988) 2, pp. 215-229
Persistent link: https://www.econbiz.de/10001057274
Cover Image
Strong NP-hardness of AC power flows feasibility
Bienstock, Daniel; Verma, Abhinav - In: Operations research letters 47 (2019) 6, pp. 494-501
Persistent link: https://www.econbiz.de/10012131850
Cover Image
Pitch, extension complexity, and covering problems
Bienstock, Daniel; Faenza, Yuri; Zhang, Xuan - In: Operations research letters 49 (2021) 3, pp. 357-364
Persistent link: https://www.econbiz.de/10012591633
Cover Image
Mathematical programming formulations for the alternating current optimal power flow problem
Bienstock, Daniel; Escobar, Mauro; Gentile, Claudio; … - In: 4OR : quarterly journal of the Belgian, French and … 18 (2020) 3, pp. 249-292
Persistent link: https://www.econbiz.de/10012307750
Cover Image
Potential function methods for approximately solving linear programming problems : theory and practice
Bienstock, Daniel - 2002
Persistent link: https://www.econbiz.de/10004757953
Cover Image
Computational integer programming
Bienstock, Daniel (contributor) - In: Mathematical programming / Series B 81,2 (1998)
Persistent link: https://www.econbiz.de/10004556424