Tight linear programming relaxations of uncapacitated p-hub median problems

By Skorin-Kapov D.   Skorin-Kapov J.   O'Kelly M.  

European Journal of Operational Research, Vol. 94, Iss. 3, 1996-11 ,pp. : 582-593

Elsevier

Access to resources Recommend Favorite

Tighter relaxations for the cutting stock problem

By Nitsche C.   Scheithauer G.   Terno J.  

European Journal of Operational Research, Vol. 112, Iss. 3, 1999-02 ,pp. : 654-663

Elsevier

Access to resources Recommend Favorite

A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem

By Galvao R.D.   Gonzalo Acosta Espejo L.   Boffey B.  

European Journal of Operational Research, Vol. 124, Iss. 2, 2000-07 ,pp. : 377-389

Elsevier

Access to resources Recommend Favorite

Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems

By Alves M.J.   Climaco J.  

European Journal of Operational Research, Vol. 117, Iss. 3, 1999-09 ,pp. : 565-577

Elsevier

Access to resources Recommend Favorite

Solving the multiobjective possibilistic linear programming problem

By Arenas Parra M.   Bilbao Terol A.   Rodrguez Ura M.V.  

European Journal of Operational Research, Vol. 117, Iss. 1, 1999-08 ,pp. : 175-182

Elsevier

Access to resources Recommend Favorite