✦ LIBER ✦

The reduced cost branch and bound algorithm for mixed integer programming

✍ Scribed by R.Kipp Martin; Dennis J. Sweeney; Michael E. Doherty

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 860 KB
Volume: 12
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(85)90039-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An implicit branch-and-bound algorithm f

An implicit branch-and-bound algorithm for mixed-integer-linear programming

✍ Youling Lin; Larry M. Austin; James R. Burns 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 596 KB

A branch and bound algorithm with constr

A branch and bound algorithm with constraint partitioning for integer goal programming problems

✍ Jeffrey L. Arthur; A. Ravindran 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 346 KB

Realization of the branch and bound meth

Realization of the branch and bound method for solving the general mixed integer programming problem

✍ M.D. Ivanchev; I.G. Mitev; N.I. Yanev 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 478 KB

A branch and bound algorithm for solving

A branch and bound algorithm for solving a class of nonlinear integer programming problems

✍ A. Victor Cabot; S. Selcuk Erenguc 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 501 KB

An approximation algorithm for quadratic

An approximation algorithm for quadratic cost 0–1 mixed integer programming problems

✍ Kumiko Mukai; Keiji Tatsumi; Masao Fukushima 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 586 KB

In this paper, we focus on the quadratic cost 01 mixed integer programming problem. First, we formulate the problem as a two-level programming problem that consists of a lower-level continuous quadratic programming problem with 01 variables fixed and an upper-level nonlinear 01 programming problem.

The mixed cutting plane algorithm for al

The mixed cutting plane algorithm for all-integer programming

✍ Larry M. Austin; Bharat C. Ruparel 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 677 KB