BRANCH AND BOUND EXPERIMENTS IN CONVEX NONLINEAR INTEGER PROGRAMMING.

Omprakash K. Gupta, Arunachalam Ravindran

Research output: Contribution to journalArticlepeer-review

286 Scopus citations

Abstract

This paper investigates the computational feasibility of branch and bound methods in solving convex nonlinear integer programming problems. The efficiency of a branch and bound method often depends on the rules used for selecting the branching variables and branching nodes. Among others, the concepts of pseudo-costs and estimations are implemented in selecting these parameters. Since the efficiency of the algorithm also depends on how fast an upper bound on the objective minimum is attained, heuristic rules are developed to locate an integer feasible solution to provide an upper bound. The different criteria for selecting branching variables, branching nodes, and heuristics form a total of 27 branch and bound strategies.

Original languageEnglish (US)
Pages (from-to)1533-1546
Number of pages14
JournalManagement Science
Volume31
Issue number12
DOIs
StatePublished - Jan 1 1985

All Science Journal Classification (ASJC) codes

  • Strategy and Management
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'BRANCH AND BOUND EXPERIMENTS IN CONVEX NONLINEAR INTEGER PROGRAMMING.'. Together they form a unique fingerprint.

Cite this