𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A simplex procedure for linear programs with some 0–1 integer constraints

✍ Scribed by A.K. Chakravarty

Book ID
107989445
Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
405 KB
Volume
9
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A heuristic with tie breaking for certai
A heuristic with tie breaking for certain 0–1 integer programming models
✍ G. Edward Fox; Gary D. Scudder 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 616 KB

A heuristic for 0-1 integer programming is proposed that features a specific rule for breaking ties that occur when attempting to determine a variable to set to 1 during a given iteration. It is tested on a large number of smallto moderate-sized randomly generated generalized set-packing models. Sol

An algorithm to perform a complete right
An algorithm to perform a complete right-hand-side parametrical analysis for a 0–1-integer linear programming problem
✍ Alejandro Crema 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 143 KB

We designed and implemented an algorithm to solve the continuous right-hand side parametric 0±1-Integer Linear Programming (ILP) problem, that is to solve a family of 0±1-ILP problems in which the problems are related by having identical objective and matrix coecients. Our algorithm works by choosin