✦ LIBER ✦

An intelligent algorithm for mixed-integer programming models

✍ Scribed by Youling Lin; Larry M. Austin; James R. Burns

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 843 KB
Volume: 19
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(92)90001-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A duality theorem and an algorithm for (

A duality theorem and an algorithm for (mixed-) integer nonlinear programming

✍ Egon Balas 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 667 KB

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

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

An approximate algorithm for nonlinear i

An approximate algorithm for nonlinear integer programming

✍ Vassil Vassilev; Krassimira Genova 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 557 KB

An algorithm for indefinite integer quad

An algorithm for indefinite integer quadratic programming

✍ S.S. Erenguc; H.P. Benson 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 551 KB

Atmtract--We present an algorithm for finding the global minimum of an indefinite quadratic function over the integers contained in a compact, convex set. To find this minJmmn, the algorithm first transforms the problem into an equivalent problem with a separable objective function. It then uses a b

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.