An intelligent algorithm for mixed-integer programming models

Youling Lin; Larry M. Austin; James R. Burns

doi:10.1016/0305-0548(92)90001-L

An intelligent algorithm for mixed-integer programming models

Youling Lin, Larry M. Austin, James R. Burns

Business Administration

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

We present an intelligent branch-and-bound algorithm and report preliminary computational results. The conventional approach to use of a particular branching strategy throughout is replaced by a branching algorithm that uses a neural network to direct the branching. The technique is shown to be significantly faster than conventional methods for certain classes of mixed integer linear programming (MILP) models.

Original language	English
Pages (from-to)	461-468
Number of pages	8
Journal	Computers and Operations Research
Volume	19
Issue number	6
DOIs	https://doi.org/10.1016/0305-0548(92)90001-L
State	Published - Aug 1992

Access to Document

10.1016/0305-0548(92)90001-L

Cite this

@article{26c8eceb799246e0acc3b19f6c8ba628,

title = "An intelligent algorithm for mixed-integer programming models",

abstract = "We present an intelligent branch-and-bound algorithm and report preliminary computational results. The conventional approach to use of a particular branching strategy throughout is replaced by a branching algorithm that uses a neural network to direct the branching. The technique is shown to be significantly faster than conventional methods for certain classes of mixed integer linear programming (MILP) models.",

author = "Youling Lin and Austin, {Larry M.} and Burns, {James R.}",

year = "1992",

month = aug,

doi = "10.1016/0305-0548(92)90001-L",

language = "English",

volume = "19",

pages = "461--468",

journal = "Computers and Operations Research",

issn = "0305-0548",

number = "6",

}

TY - JOUR

T1 - An intelligent algorithm for mixed-integer programming models

AU - Lin, Youling

AU - Austin, Larry M.

AU - Burns, James R.

PY - 1992/8

Y1 - 1992/8

N2 - We present an intelligent branch-and-bound algorithm and report preliminary computational results. The conventional approach to use of a particular branching strategy throughout is replaced by a branching algorithm that uses a neural network to direct the branching. The technique is shown to be significantly faster than conventional methods for certain classes of mixed integer linear programming (MILP) models.

AB - We present an intelligent branch-and-bound algorithm and report preliminary computational results. The conventional approach to use of a particular branching strategy throughout is replaced by a branching algorithm that uses a neural network to direct the branching. The technique is shown to be significantly faster than conventional methods for certain classes of mixed integer linear programming (MILP) models.

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

U2 - 10.1016/0305-0548(92)90001-L

DO - 10.1016/0305-0548(92)90001-L

M3 - Article

AN - SCOPUS:0026908911

VL - 19

SP - 461

EP - 468

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - 6

ER -

An intelligent algorithm for mixed-integer programming models

Abstract

Access to Document

Other files and links

Fingerprint

Cite this