New facets and a branch-and-cut algorithm for the weighted clique problem

By Sorensen M.M.  

European Journal of Operational Research, Vol. 154, Iss. 1, 2004-04 ,pp. : 57-70

Elsevier

Access to resources Recommend Favorite

An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs

By Lan Y.-F.   Wang Y.-L.  

European Journal of Operational Research, Vol. 122, Iss. 3, 2000-05 ,pp. : 602-610

Elsevier

Access to resources Recommend Favorite

K -vertex-connectivity minimum augmentation for undirected unweighted graphs*

By Cao Qiguo   Wu Xue   Sun Yugeng  

Progress in Natural Science, Vol. 13, Iss. 6, 2003-06 ,pp. : 434-445

Taylor & Francis Ltd

Access to resources Recommend Favorite

Reasoning with contextual graphs

By Brezillon P.   Pasquier L.   Pomerol J.-C.  

European Journal of Operational Research, Vol. 136, Iss. 2, 2002-01 ,pp. : 290-298

Elsevier

Access to resources Recommend Favorite

Graphs and Scheduling (ECCO XIII)

By Improta G.   Martello S.  

European Journal of Operational Research, Vol. 142, Iss. 2, 2002-10 ,pp. : 219-220

Elsevier

Access to resources Recommend Favorite