### 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 language | English (US) |
---|---|

Pages (from-to) | 1533-1546 |

Number of pages | 14 |

Journal | Management Science |

Volume | 31 |

Issue number | 12 |

DOIs | |

State | Published - Jan 1 1985 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Strategy and Management
- Management Science and Operations Research

### Cite this

*Management Science*,

*31*(12), 1533-1546. https://doi.org/10.1287/mnsc.31.12.1533

}

*Management Science*, vol. 31, no. 12, pp. 1533-1546. https://doi.org/10.1287/mnsc.31.12.1533

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

Research output: Contribution to journal › Article

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 -