Narrow search
Showing 1 - 10 of 4,108
Cover Image
Mathematical models and routing algorithms for economical cutting tool paths
Makarovskikh, T. A.; Panyukov, A. V.; Savitskiy, E. A. - In: International journal of production research 56 (2018) 3, pp. 1171-1188
Persistent link: https://www.econbiz.de/10011870694
Cover Image
Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs
Zhou, Yi; Rossi, André; Hao, Jin-Kao - In: European journal of operational research : EJOR 269 (2018) 3, pp. 834-843
Persistent link: https://www.econbiz.de/10011866668
Cover Image
Algorithms for competitive division of chores
Brânzei, Simina; Sandomirskiy, Fedor - In: Mathematics of operations research 49 (2024) 1, pp. 398-429
Persistent link: https://www.econbiz.de/10014527950
Cover Image
On rooted k-connectivity problems in quasi-bipartite digraphs
Nutov, Zeev - In: Operations research forum 5 (2024) 1, pp. 1-12
Persistent link: https://www.econbiz.de/10014517535
Cover Image
Stable set reformulations for the degree preserving spanning tree problem
Lucena, Abílio; Cunha, Alexandre Salles da - In: European journal of operational research : EJOR 319 (2024) 1, pp. 50-61
Persistent link: https://www.econbiz.de/10015083522
Cover Image
Parameterized (in)approximability of subset problems
Bonnet, Édouard; Paschos, Vangelis Th. - In: Operations research letters 42 (2014) 3, pp. 222-225
Persistent link: https://www.econbiz.de/10010383186
Cover Image
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng; Wang, Yansong - In: International journal of production research 50 (2012) 24, pp. 7303-7312
Persistent link: https://www.econbiz.de/10009679281
Cover Image
A lagrangian bound on the clique number and an exact algorithm for the maximum edge weight clique problem
Hosseinian, Seyedmohammadhossein; Fontes, Dalila B. M. M.; … - In: INFORMS journal on computing : JOC 32 (2020) 3, pp. 747-762
Persistent link: https://www.econbiz.de/10012294726
Cover Image
The circlet inequalities : a new, circulant-based, facet-defining inequality for the TSP
Gutekunst, Samuel C.; Williamson, David P. - In: Mathematics of operations research 48 (2023) 1, pp. 393-418
Persistent link: https://www.econbiz.de/10014312556
Cover Image
A game-theoretic approach to graph clustering
Mandala, Supreet; Kumara, Soundar; Chatterjee, Kalyan - In: INFORMS journal on computing : JOC 26 (2014) 3, pp. 629-643
Persistent link: https://www.econbiz.de/10010399733