BRANCH AND BOUND EXPERIMENTS IN CONVEX NONLINEAR INTEGER PROGRAMMING.

Omprakash K. Gupta, Arunachalam Ravindran

Research output: Contribution to journalArticle

260 Citations (Scopus)

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

Fingerprint

Branch-and-bound
Integer programming
Experiment
Heuristics
Node
Upper bound
Integer
Costs

All Science Journal Classification (ASJC) codes

  • Strategy and Management
  • Management Science and Operations Research

Cite this

Gupta, Omprakash K. ; Ravindran, Arunachalam. / BRANCH AND BOUND EXPERIMENTS IN CONVEX NONLINEAR INTEGER PROGRAMMING. In: Management Science. 1985 ; Vol. 31, No. 12. pp. 1533-1546.
@article{ba42a4bd6fb94870938d2a4ce04e892f,
title = "BRANCH AND BOUND EXPERIMENTS IN CONVEX NONLINEAR INTEGER PROGRAMMING.",
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.",
author = "Gupta, {Omprakash K.} and Arunachalam Ravindran",
year = "1985",
month = "1",
day = "1",
doi = "10.1287/mnsc.31.12.1533",
language = "English (US)",
volume = "31",
pages = "1533--1546",
journal = "Management Science",
issn = "0025-1909",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "12",

}

BRANCH AND BOUND EXPERIMENTS IN CONVEX NONLINEAR INTEGER PROGRAMMING. / Gupta, Omprakash K.; Ravindran, Arunachalam.

In: Management Science, Vol. 31, No. 12, 01.01.1985, p. 1533-1546.

Research output: Contribution to journalArticle

TY - JOUR

T1 - BRANCH AND BOUND EXPERIMENTS IN CONVEX NONLINEAR INTEGER PROGRAMMING.

AU - Gupta, Omprakash K.

AU - Ravindran, Arunachalam

PY - 1985/1/1

Y1 - 1985/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0022208326&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022208326&partnerID=8YFLogxK

U2 - 10.1287/mnsc.31.12.1533

DO - 10.1287/mnsc.31.12.1533

M3 - Article

AN - SCOPUS:0022208326

VL - 31

SP - 1533

EP - 1546

JO - Management Science

JF - Management Science

SN - 0025-1909

IS - 12

ER -