A reduction algorithm for integer multiple objective linear programs

Author： Schweigert D.   Neumayer P.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.99, Iss.2, 1997-06, pp. : 459-462

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An algorithm for the multiparametric 0-1-integer linear programming problem relative to the objective function

By Crema A.  

European Journal of Operational Research, Vol. 125, Iss. 1, 2000-08 ,pp. : 18-24

Elsevier

Access to resources Recommend Favorite

A branch and bound algorithm for mixed zero-one multiple objective linear programming

By Mavrotas G.   Diakoulaki D.  

European Journal of Operational Research, Vol. 107, Iss. 3, 1998-06 ,pp. : 530-541

Elsevier

Access to resources Recommend Favorite

A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs

By Dauer J.P.   Gallagher R.J.  

European Journal of Operational Research, Vol. 88, Iss. 2, 1996-01 ,pp. : 368-381

Elsevier

Access to resources Recommend Favorite

An optimality cut for mixed integer linear programs

By Laporte G.   Semet F.  

European Journal of Operational Research, Vol. 119, Iss. 3, 1999-12 ,pp. : 671-677

Elsevier

Access to resources Recommend Favorite

A contraction algorithm for the multiparametric integer linear programming problem

By Crema A.  

European Journal of Operational Research, Vol. 101, Iss. 1, 1997-08 ,pp. : 130-139

Elsevier

Access to resources Recommend Favorite