The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations

By Macambira E.M.   de Souza C.C.  

European Journal of Operational Research, Vol. 123, Iss. 2, 2000-06 ,pp. : 346-371

Elsevier

Access to resources Recommend Favorite

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

Optimizing acyclic traffic signal switching sequences through an Extended Linear Complementarity Problem formulation

By De Schutter B.  

European Journal of Operational Research, Vol. 139, Iss. 2, 2002-06 ,pp. : 400-415

Elsevier

Access to resources Recommend Favorite

The process of problem-formulation

By Bowen K.  

European Journal of Operational Research, Vol. 128, Iss. 2, 2001-01 ,pp. : 258-265

Elsevier

Access to resources Recommend Favorite

A Lagrangean heuristic for the maximal covering location problem

By Galvao R.D.   ReVelle C.  

European Journal of Operational Research, Vol. 88, Iss. 1, 1996-01 ,pp. : 114-123

Elsevier

Access to resources Recommend Favorite