Narrow search
Showing 1 - 6 of 6
Cover Image
Maximizing expected utility over a knapsack constraint
Yu, Jianjin; Ahmed, Shabbir - In: Operations research letters 44 (2016) 2, pp. 180-185
Persistent link: https://www.econbiz.de/10011457277
Cover Image
Lifting of probabilistic cover inequalities
Joung, Seulgi; Park, Sungsoo - In: Operations research letters 45 (2017) 5, pp. 513-518
Persistent link: https://www.econbiz.de/10011774718
Cover Image
Ants can orienteer a thief in their robbery
Chagas, Jonatas B. C.; Wagner, Markus - In: Operations research letters 48 (2020) 6, pp. 708-714
Persistent link: https://www.econbiz.de/10012430073
Cover Image
A faster algorithm for the continuous bilevel knapsack problem
Fischer, Dennis; Woeginger, Gerhard J. - In: Operations research letters 48 (2020) 6, pp. 784-786
Persistent link: https://www.econbiz.de/10012430132
Cover Image
Cover by disjoint cliques cuts for the knapsack problem with conflicting items
Luiz, Thiago Alcântara; Santos, Haroldo Gambini; … - In: Operations research letters 49 (2021) 6, pp. 844-850
Persistent link: https://www.econbiz.de/10013266055
Cover Image
A knapsack intersection hierarchy
Jozefiak, Adam; Shepherd, F. Bruce; Weninger, Noah - In: Operations research letters 51 (2023) 1, pp. 72-78
Persistent link: https://www.econbiz.de/10014283298