✦ LIBER ✦

Zero-one integer programs with few constraints —Efficient branch and bound algorithms

✍ Scribed by Bezalel Gavish; Hasan Pirkul

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 723 KB
Volume: 22
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(85)90113-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Zero-one programming with many variables

Zero-one programming with many variables and few constraints

✍ A.L. Soyster; B. Lev; W. Slivka 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 940 KB

A single-branch implicit enumeration alg

A single-branch implicit enumeration algorithm for zero-one programs with geometrical constraints

✍ R.Michael Harnett 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 895 KB

A comparison of a constraint aggregation

A comparison of a constraint aggregation and partitioning zero-one goal programming algorithm with the lee and Morris algorithm

✍ Sang M. Lee; Richard L. Luebbe 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 644 KB

Optimal Compile-Time Multiprocessor Sche

Optimal Compile-Time Multiprocessor Scheduling Based on the O–1 Linear Programming Algorithm with the Branch and Bound Technique

✍ D.Antony Louis Piriyakumar; C.Siva Ram Murthy 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 238 KB

This paper is organized as follows. We describe the formulation of the problem and the required definitions in Section II. In Section III, the performance improvement over [6] due to processor isomorphism and look ahead pruning in reducing the search space is explained, along with a note on the lowe