𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new hybrid GA solution to combinatorial optimization problems— an application to the multiprocessor scheduling problem

✍ Scribed by M. Nakamura; B. M. Ombuki; K. Shimabukuro; K. Onaga

Publisher
Springer Japan
Year
1998
Tongue
English
Weight
485 KB
Volume
2
Category
Article
ISSN
1433-5298

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An application of the combinatorial Null
An application of the combinatorial Nullstellensatz to a graph labelling problem
✍ Dan Hefetz; Annina Saluz; Huong T. T. Tran 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB

## Abstract An __antimagic labelling__ of a graph __G__ with __m__ edges and __n__ vertices is a bijection from the set of edges of __G__ to the set of integers {1,…,__m__}, such that all __n__ vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with tha

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

On a new notion of the solution to an il
On a new notion of the solution to an ill-posed problem
✍ A.G. Ramm 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 251 KB

A new understanding of the notion of the stable solution to ill-posed problems is proposed. The new notion is more realistic than the old one and better fits the practical computational needs. A method for constructing stable solutions in the new sense is proposed and justified. The basic point is: