𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient one—dimensional search procedure for barrier functions

✍ Scribed by L. S. Lasdon; R. L. Fox; M. W. Ratner

Publisher
Springer-Verlag
Year
1973
Tongue
English
Weight
681 KB
Volume
4
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Epcot: An efficient procedure for colori
Epcot: An efficient procedure for coloring optimally with Tabu Search
✍ N. Dubois; D. de Werra 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 707 KB

We present an exact procedure for coloring the nodes of s graph with as few colors as possible. The problem o~ deciding whether an arbitrary graph can be colored with k colars is NP-complete. The procedure is based ms an implicit enumm'&tion technique. At some stsgrs of the algorithm heuristic metho

An efficient tabu search procedure for t
An efficient tabu search procedure for the p-Median Problem
✍ Erik Rolland; David A. Schilling; John R. Current 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 944 KB

In this paper we present a new solution heuristic for the p-Median Problem. The algorithm is based on tabu search principles, and uses short term and long term memory, as well as strategic oscillation and random tabu list sizes. Our proposed procedure is compared with two other move heuristics: a we