Skip to main content
SpringerLink
Log in

A new method of integer linear programming—Branch direction search method

  • Published:
Applied Mathematics and Mechanics Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

An endeavour is made in this paper to present a new and simple ILP algorithm for optimization. It has the most desirable features of robustness and fast convergence. The algorithm is successful in applying it to some problems arisen in engineering design.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Garfinkel Robert S.,Integer Programming, (1972).

  2. Golver Fred, Improved linear integer programming formulations of nonlinear integer problem,Decision Science,22, 1 (1975).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Huazhong University of Science and Technology, Wuhan

    Xia De-lin

Authors
  1. Xia De-lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Li Hao

Rights and permissions

Reprints and permissions

About this article

Cite this article

De-lin, X. A new method of integer linear programming—Branch direction search method. Appl Math Mech 6, 283–290 (1985). https://doi.org/10.1007/BF01895525

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01895525

Keywords

Search

Navigation