Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems

Author： Mitchell J.E.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.97, Iss.1, 1997-02, pp. : 139-148

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

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

An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound

By Alves M.J. Clmaco J.

European Journal of Operational Research, Vol. 124, Iss. 3, 2000-08 ,pp. : 478-494

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

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

Ranking in quadratic integer programming problems

By Gupta R. Bandopadhyaya L. Puri M.C.

European Journal of Operational Research, Vol. 95, Iss. 1, 1996-11 ,pp. : 231-236

Elsevier

Access to resources Recommend Favorite