Narrow search
Showing 1 - 10 of 114,400
Cover Image
Optimising data-driven network under limited resource : a partial diversification approach
Wu, Dexiang; Wu, Desheng Dash; Kwon, Roy H. - In: International journal of production research 57 (2019) 21, pp. 6875-6892
Persistent link: https://www.econbiz.de/10012193767
Cover Image
Branch-and-bound for bi-objective integer programming
Parragh, Sophie N.; Tricoire, Fabien - In: INFORMS journal on computing : JOC 31 (2019) 4, pp. 805-822
Persistent link: https://www.econbiz.de/10012125761
Cover Image
Thinner is not always better : cascade knapsack problems
Krishnamoorthy, Bala - In: Operations research letters 45 (2017) 1, pp. 77-83
Persistent link: https://www.econbiz.de/10011687210
Cover Image
Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
Silva, Marco; Poss, Michael; Maculan F., Nelson - In: European journal of operational research : EJOR 283 (2020) 1, pp. 70-82
Persistent link: https://www.econbiz.de/10012161923
Cover Image
A branch-and-bound algorithm for the quadratic multiple knapsack problem
Fleszar, Krzysztof - In: European journal of operational research : EJOR 298 (2022) 1, pp. 89-98
Persistent link: https://www.econbiz.de/10013206812
Cover Image
Bin packing problem with time lags
Rivera Letelier, Orlando; Clautiaux, François; … - In: INFORMS journal on computing : JOC ; charting new … 34 (2022) 4, pp. 2249-2270
Persistent link: https://www.econbiz.de/10013362732
Cover Image
Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem
Aïder, Méziane; Gacem, Oussama; Hifi, Mhand - In: Journal of the Operational Research Society 73 (2022) 3, pp. 540-557
Persistent link: https://www.econbiz.de/10013170161
Cover Image
Optimizing over the closure of rank inequalities with a small right-hand side for the maximum stable set problem via bilevel programming
Coniglio, Stefano; Gualandi, Stefano - In: INFORMS journal on computing : JOC ; charting new … 34 (2022) 2, pp. 1006-1023
Persistent link: https://www.econbiz.de/10013361401
Cover Image
Exact approaches for the unconstrained two-dimensional cutting problem with defects
Zhang, Hao; Yao, Shaowen; Liu, Qiang; Leng, Jiewu; Wei, … - In: Computers & operations research : and their … 160 (2023), pp. 1-19
Persistent link: https://www.econbiz.de/10014434489
Cover Image
Branch-and-bound and dynamic programming approaches for the knapsack problem
Burashnikov, Evgenii - In: Operations research forum 5 (2024) 4, pp. 1-19
Persistent link: https://www.econbiz.de/10015182041