𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on the Pivot and Complement heuristic for 0–1 programming problems

✍ Scribed by Ronny Aboudi; Åsa Hallefjord; Reidun Helming; Kurt Jørnsten

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
141 KB
Volume
8
Category
Article
ISSN
0167-6377

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 note on the use of goal programming fo
A note on the use of goal programming for the multiplicative AHP
✍ R. RAMANATHAN 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 311 KB 👁 2 views

The main aim of this paper is to identify the opportunities of utilizing goal programming (GP) in the multiplicative analytic hierarchy process (MAHP). It starts with the issue of weight derivation from judgemental matrices. The use of GP for the weight derivation problem is not new, but GP is viewe

A Note on the Riemann Problem for Genera
A Note on the Riemann Problem for General n × n Conservation Laws
✍ Fabio Ancona; Andrea Marson 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 119 KB

We analyze the structure of the general solution of the Riemann problem for a strictly hyperbolic system of conservation laws whose characteristic fields are neither genuinely non-linear nor linearly degenerate in the sense of Lax.