𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Organizing a social event—A difficult problem of combinatorial optimization

✍ Scribed by S.C. Brailsford; P.M. Hubbard; B.M. Smith; H.P. Williams

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
759 KB
Volume
23
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A CASCADE OPTIMIZATION STRATEGY FOR SOLU
A CASCADE OPTIMIZATION STRATEGY FOR SOLUTION OF DIFFICULT DESIGN PROBLEMS
✍ SURYA N. PATNAIK; RULA M. CORONEOS; DALE A. HOPKINS 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 438 KB 👁 2 views

A research project to evaluate comparatively ten different non-linear optimization algorithms was completed recently. A conclusion was that no single optimizer could successfully solve all the 40 structural design problems in the test-bed, even though most optimizers successfully solved at least one

Optimal overload control of systems with
Optimal overload control of systems with access buffers — a difficult problem
✍ Tobias Rydén 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 118 KB

Overload control of for example a telephone switch is often implemented using an access buffer, which is a buffer where new calls are stored before they are given service by the switch. In this paper various approaches to how one could find good load control policies for such systems are discussed,

Solving a combinatorial problem via self
Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
✍ J. C. Fort 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 586 KB

We present an application of the Kohonen algorithm to the traveling salesman problem: Using only this algorithm, without energy function nor any parameter chosen "ad hoc", we found good suboptimal tours. We give a neural model version of this algorithm, closer to classical neural networks. This is i