Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines∗

By Kacem Imed   Sahnoune Myriam   Schmidt Günter  

RAIRO - Operations Research, Vol. 51, Iss. 4, 2017-11 ,pp. : 1177-1188

Edp Sciences

Access to resources Recommend Favorite

Perfectly matchable subgraph problem on a bipartite graph

By Sharifov Firdovsi  

RAIRO - Operations Research, Vol. 44, Iss. 1, 2010-02 ,pp. : 27-42

Edp Sciences

Access to resources Recommend Favorite

Algorithms for the two dimensional bin packing problem with partial conflicts

By Hamdi-Dhaoui Khaoula   Labadie Nacima   Yalaoui Alice  

RAIRO - Operations Research, Vol. 46, Iss. 1, 2012-05 ,pp. : 41-62

Edp Sciences

Access to resources Recommend Favorite

Super-polynomial approximation branching algorithms∗

By Escoffier Bruno   Paschos Vangelis Th.   Tourniaire Emeric  

RAIRO - Operations Research, Vol. 50, Iss. 4-5, 2016-11 ,pp. : 979-994

Edp Sciences

Access to resources Recommend Favorite

Linear time algorithms to solve the linear ordering problem for oriented tree based graphs

By Quilliot Alain   Rebaine Djamal  

RAIRO - Operations Research, Vol. 50, Iss. 2, 2016-03 ,pp. : 315-325

Edp Sciences

Access to resources Recommend Favorite