Narrow search
Showing 1 - 6 of 6
Cover Image
Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique
Pessoa, Artur; Hahn, Peter M.; Guignard-Spielberg, Monique - In: European journal of operational research : EJOR 206 (2010) 1, pp. 54-63
Persistent link: https://www.econbiz.de/10003968283
Cover Image
A branch-and-bound algorithm for the close-enough traveling salesman problem
Coutinho, Walton Pereira; Nascimento, Roberto Quirino do; … - In: INFORMS journal on computing : JOC 28 (2016) 4, pp. 752-765
Persistent link: https://www.econbiz.de/10011617601
Cover Image
An improved branch-cut-and-price algorithm for parallel machine scheduling problems
Oliveira, Daniel Ribeiro de; Pessoa, Artur - In: INFORMS journal on computing : JOC 32 (2020) 1, pp. 90-100
Persistent link: https://www.econbiz.de/10012182988
Cover Image
A distributed dual ascent algorithm for the Hop-constrained Steiner Tree Problem
Santos, Marcelo; Drummond, Lúcia M. A.; Uchoa, Eduardo - In: Operations research letters 38 (2010) 1, pp. 57-62
Persistent link: https://www.econbiz.de/10003941998
Cover Image
On the exact solution of a large class of parallel machine scheduling problems
Bulhões, Teobaldo; Sadykov, Ruslan; Subramanian, Anand; … - In: Journal of scheduling : JOS 23 (2020) 4, pp. 411-429
Persistent link: https://www.econbiz.de/10012291273
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