✦ LIBER ✦

A heuristic 0–1 integer programming method

✍ Scribed by Felix Baessler

Book ID: 105307955
Publisher: Springer
Year: 1992
Tongue: German
Weight: 521 KB
Volume: 14
Category: Article
ISSN: 0171-6468
DOI: 10.1007/bf01783498

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

A HEURISTIC FOR GENERAL INTEGER PROGRAMM

A HEURISTIC FOR GENERAL INTEGER PROGRAMMING

✍ Gary A. Kochenberger; Bruce A. McCarl; F. Paul Wyman 📂 Article 📅 1974 🏛 Decision Sciences Institute, Georgia State Univers 🌐 English ⚖ 306 KB

Constrained discriminant analysis via 0/

Constrained discriminant analysis via 0/1 mixed integer programming

✍ Richard J. Gallagher; Eva K. Lee; David A. Patterson 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 131 KB

Heuristic solution procedures for a mixe

Heuristic solution procedures for a mixed-integer programming discriminant model

✍ Paul A. Rubin 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 939 KB

Multi-objective distribution network res

Multi-objective distribution network restoration using heuristic approach and mix integer programming method

📂 Article 📅 2001 🏛 Elsevier Science ⚖ 192 KB

A dynamic attribute reduction algorithm

A dynamic attribute reduction algorithm based on 0-1 integer programming

✍ Yitian Xu; Laisheng Wang; Ruiyan Zhang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 260 KB