Narrow search
Showing 1 - 4 of 4
Cover Image
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems
Tamir, Arie - In: Operations research letters 37 (2009) 5, pp. 303-306
Persistent link: https://www.econbiz.de/10003931956
Cover Image
An optimal 0 (n log n) algorithm for finding an enclosing planar rectilinear annulus of minimum width
Gluchshenko, Olga N.; Hamacher, Horst W.; Tamir, Arie - In: Operations research letters 37 (2009) 3, pp. 168-170
Persistent link: https://www.econbiz.de/10003903892
Cover Image
Reviewing extensions and solution methods of the planar Weber single facility location problem
Church, Richard L.; Drezner, Zvi; Plastria, Frank; … - In: Computers & operations research : an international journal 173 (2025), pp. 1-12
Persistent link: https://www.econbiz.de/10015101651
Cover Image
Extensions to the Weber problem
Church, Richard L.; Drezner, Zvi; Tamir, Arie - In: Computers & operations research : and their … 143 (2022), pp. 1-10
Persistent link: https://www.econbiz.de/10013343295