An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.104, Iss.3, 1998-02, pp. : 601-614

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 procedure to verify the completeness of the right-hand-side parametric analysis for a mixed integer linear programming problem

By Crema A.

European Journal of Operational Research, Vol. 108, Iss. 3, 1998-08 ,pp. : 684-695

Elsevier

Access to resources Recommend Favorite

A simple Tabu Search method to solve the mixed-integer linear bilevel programming problem

By U. P.W. A. D.H.

European Journal of Operational Research, Vol. 88, Iss. 3, 1996-02 ,pp. : 563-571

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

Solving zero-one mixed integer programming problems using tabu search

By Lokketangen A. Glover F.

European Journal of Operational Research, Vol. 106, Iss. 2, 1998-04 ,pp. : 624-658

Elsevier

Access to resources Recommend Favorite