Narrow search
Showing 1 - 10 of 12
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
On the core of a traveling salesman cost allocation game
Tamir, Arie - In: Operations research letters 8 (1989) 1, pp. 31-34
Persistent link: https://www.econbiz.de/10001067448
Cover Image
Minimum Lk path partitioning : an illustration of the Monge property
Ho, Pei-hao; Tamir, Arie; Wu, Bang Ye - In: Operations research letters 36 (2008) 1, pp. 43-45
Persistent link: https://www.econbiz.de/10003768471
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
Locating two obnoxious facilities using the weighted maximin criterion
Tamir, Arie - In: Operations research letters 34 (2006) 1, pp. 97-105
Persistent link: https://www.econbiz.de/10006809490
Cover Image
An optimal 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/10008244843
Cover Image
Minimum path partitioning—An illustration of the Monge property
Ho, Pei-Hao; Tamir, Arie; Wu, Bang Ye - In: Operations research letters 36 (2008) 1, pp. 43-45
Persistent link: https://www.econbiz.de/10007896717
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-307
Persistent link: https://www.econbiz.de/10008881924
Cover Image
An optimal 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-171
Persistent link: https://www.econbiz.de/10008891568
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/10008309004