Narrow search
Showing 1 - 10 of 75
Cover Image
Efficient algorithms under dynamic graphs to solve the capacitated arc routing problem with feasible sparse graph
Tfaili, Sara; Dkhil, Hamdi; Sbihi, Abdelkader; Yassine, … - In: RAIRO / Operations research 53 (2019) 1, pp. 303-322
Persistent link: https://www.econbiz.de/10012113645
Cover Image
New complexity results on scheduling problem in a robotic cell
Chikhi, Nacira; Abbas, Moncef; Benmansour, Rachid; … - In: RAIRO / Operations research 51 (2017) 3, pp. 749-762
Persistent link: https://www.econbiz.de/10011858798
Cover Image
Solving the Minimum Independent Domination Set problem in graphs by exact algorithm and greedy heuristic
Laforest, Christian; Phan, Raksmey - In: RAIRO / Operations research 47 (2013) 3, pp. 199-221
Persistent link: https://www.econbiz.de/10010492813
Cover Image
Linear time algorithms to solve the linear ordering problem for oriented tree based graphs
Quilliot, Alain; Rebaine, Djamal - In: RAIRO / Operations research 50 (2016) 2, pp. 315-325
Persistent link: https://www.econbiz.de/10011672856
Cover Image
Combinatorial approximation of maximum k-VERTEX cover in bipartite graphs within ration 0.7
Paschos, Vangelis Th. - In: RAIRO / Operations research 52 (2018) 1, pp. 305-314
Persistent link: https://www.econbiz.de/10011968720
Cover Image
The vertex attack tolerance of complex networks
Matta, John; Ercal, Gunes; Borwey, Jeffrey - In: RAIRO / Operations research 51 (2017) 4, pp. 1055-1076
Persistent link: https://www.econbiz.de/10011859490
Cover Image
Throughput optimization for the robotic cell problem with controllable processing times
Al-Salem, Mohammed; Kharbeche, Mohamed - In: RAIRO / Operations research 51 (2017) 3, pp. 805-818
Persistent link: https://www.econbiz.de/10011858837
Cover Image
An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
Sousa, Ernando Gomes de; Santos, Andréa Cynthia; … - In: RAIRO / Operations research 49 (2015) 1, pp. 143-160
Persistent link: https://www.econbiz.de/10011308433
Cover Image
Approximation hardness of graphic TSP on cubic graphs
Karpiński, Marek; Schmied, Richard - In: RAIRO / Operations research 49 (2015) 4, pp. 651-668
Persistent link: https://www.econbiz.de/10011546680
Cover Image
Block decomposition approach to compute a minimum geodetic set
Ekim, Tinaz; Erey, Aysel - In: RAIRO / Operations research 48 (2014) 4, pp. 497-507
Persistent link: https://www.econbiz.de/10011454198