𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A tabu-search-based algorithm for continuous multiminima problems

✍ Scribed by Francesco Franzè; Nicolò Speciale

Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
131 KB
Volume
50
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tabu search algorithm for the Capacita
A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
✍ Sharaiha, Yazid M.; Gendreau, Michel; Laporte, Gilbert; Osman, Ibrahim H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 2 views

The Capacitated Shortest Spanning Tree Problem consists of determining a shortest spanning tree in a vertex weighted graph such that the weight of every subtree linked to the root by an edge does not exceed a prescribed capacity. We propose a tabu search heuristic for this problem, as well as dynami

A tabu search heuristic for the Steiner
A tabu search heuristic for the Steiner Tree Problem
✍ Gendreau, Michel; Larochelle, Jean-Francois; Sans�, Brunilde 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB 👁 2 views

The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has regained attention due to the introduction of new telecommunication technologies, such as ATM, since it appears as the inherent mathematical structure behind multicast communications. In this paper, we present a tabu se

A Riccati-equation-based algorithm for c
A Riccati-equation-based algorithm for continuous-time optimal control problems
✍ Joe Imae 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB 👁 1 views

In this paper we consider continuous-time unconstrained optimal control problems. We propose a computational method which is essentially based on the closed-loop solutions of the linear quadratic optimal control problems. In the proposed algorithm, Riccati differential equations play an important ro

A new tabu search procedure for an audit
A new tabu search procedure for an audit-scheduling problem
✍ Peter Brucker; Doris Schumacher 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 141 KB 👁 1 views

We consider the following version of the auditing problem. A set of jobs must be processed by auditors A , . . . , A K . Each job consists of several tasks and there may be precedence constraints between these tasks. There is a due date associated with each job. Each auditor is available during disj

A tabu search heuristic for periodic and
A tabu search heuristic for periodic and multi-depot vehicle routing problems
✍ Cordeau, Jean-Fran�ois; Gendreau, Michel; Laporte, Gilbert 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB

We propose a tabu search heuristic capable of solving three well-known routing problems: the periodic vehicle routing problem, the periodic traveling salesman problem, and the multi-depot vehicle routing problem. Computational experiments carried out on instances taken from the literature indicate t

A tabu search strategy for an efficient
A tabu search strategy for an efficient solution of linear systems in electromagnetic problems
✍ M. Dionigi; R. Sorrentino; L. Tarricone; A. Esposito 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB 👁 2 views

A strategy is proposed to enhance the performance of some numerical methods used in the solution of electromagnetic problems. The strategy can be extended to any numerical method based on the partitioning of the spatial domain into elementary cells. Two different implementations of the strategy are