Narrow search
Showing 1 - 10 of 654
Cover Image
The discrete moment problem with fractional moments
Ninh, Anh; Prékopa, András - In: Operations research letters 41 (2013) 6, pp. 715-718
Persistent link: https://www.econbiz.de/10010236024
Cover Image
An LP-based 2/3-approximation algorithm for the s-t path graph traveling salesman problem
Gao, Zhihan - In: Operations research letters 41 (2013) 6, pp. 615-617
Persistent link: https://www.econbiz.de/10010236087
Cover Image
Optimization of demand response through peak shaving
Zakeri, Golbon; Craigie, D.; Philpott, A. B.; Todd, … - In: Operations research letters 42 (2014) 1, pp. 97-101
Persistent link: https://www.econbiz.de/10010259226
Cover Image
A polynomial projection-type algorithm for linear programming
Végh, Lászlo A.; Zambelli, Giacomo - In: Operations research letters 42 (2014) 1, pp. 91-96
Persistent link: https://www.econbiz.de/10010259228
Cover Image
A note on the optimal stopping parking problem
Truong, Nguyen L. - In: Operations research letters 43 (2015) 1, pp. 96-98
Persistent link: https://www.econbiz.de/10010486287
Cover Image
On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints
Zhang, An - In: Operations research letters 43 (2015) 5, pp. 522-525
Persistent link: https://www.econbiz.de/10011386461
Cover Image
A note on the approximability of deepest-descent circuit steps
Borgwardt, Steffen Alexander; Brand, Cornelius; … - In: Operations research letters 49 (2021) 3, pp. 310-315
Persistent link: https://www.econbiz.de/10012591615
Cover Image
The LP-Newton method for standard form linear programming problems
Kitahara, Tomonari; Mizuno, Shinji; Shi, Jianming - In: Operations research letters 41 (2013) 5, pp. 426-429
Persistent link: https://www.econbiz.de/10010189898
Cover Image
Local improvement algorithms for a path packing problem : a performance analysis based on linear programming
Bontridder, K. M. J. de; Halldórsson, B. V.; … - In: Operations research letters 49 (2021) 1, pp. 62-68
Persistent link: https://www.econbiz.de/10012486226
Cover Image
On the extension complexity of scheduling polytopes
Tiwary, Hans Raj; Verdugo, Victor; Wiese, Andreas - In: Operations research letters 48 (2020) 4, pp. 472-479
Persistent link: https://www.econbiz.de/10012294795