Narrow search
Showing 1 - 10 of 254
Cover Image
Bounds on the size of branch-and-bound proofs for integer knapsacks
Krishnamoorthy, Bala - In: Operations research letters 36 (2008) 1, pp. 19-25
Persistent link: https://www.econbiz.de/10003768458
Cover Image
Allocating procurement to capacitated suppliers with concave quantity discounts
Burke, Gerard J.; Geunes, Joseph; Romeijn, H. Edwin; … - In: Operations research letters 36 (2008) 1, pp. 103-109
Persistent link: https://www.econbiz.de/10003768568
Cover Image
Polymatroids and mean-risk minimization in discrete optimization
Atamtürk, Alper; Narayanan, Vishnu - In: Operations research letters 36 (2008) 5, pp. 618-622
Persistent link: https://www.econbiz.de/10003786795
Cover Image
A robust approach to the chance-constrained knapsack problem
Klopfenstein, Olivier; Nace, Dritan - In: Operations research letters 36 (2008) 5, pp. 628-632
Persistent link: https://www.econbiz.de/10003786798
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 a class of mixed-integer sets with a single integer variable
Di Summa, Marco - In: Operations research letters 38 (2010) 6, pp. 556-558
Persistent link: https://www.econbiz.de/10008738527
Cover Image
How important are branching decisions : fooling MIP solvers
Le Bodic, Pierre; Nemhauser, George L. - In: Operations research letters 43 (2015) 3, pp. 273-278
Persistent link: https://www.econbiz.de/10011309550
Cover Image
On the complete set packing and set partitioning polytopes : properties and rank 1 facets
Bulhões, Teobaldo; Pessoa, Artur; Protti, Fábio; … - In: Operations research letters 46 (2018) 4, pp. 389-392
Persistent link: https://www.econbiz.de/10011916155
Cover Image
A powerful route minimization heuristic for the vehicle routing problem with time windows
Nagata, Yuichi; Bräysy, Olli - In: Operations research letters 37 (2009) 5, pp. 333-338
Persistent link: https://www.econbiz.de/10003932237
Cover Image
Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
Paul, Gerald - In: Operations research letters 38 (2010) 6, pp. 577-581
Persistent link: https://www.econbiz.de/10008738501