![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Journal of Mathematical Modelling and Algorithms, Volume 7
Volume 7, Number 1, March 2008
- Victor J. Rayward-Smith:
Editorial. 1-2 - Natalio Krasnogor, Jim Smith:
Memetic Algorithms: The Polynomial Local Search Complexity Theory Perspective. 3-24 - Andrzej Jaszkiewicz
:
Distance Preserving Recombination Operator for Earth Observation Satellites Operations Scheduling. 25-42 - Maurizio Boccia
, Antonio Sforza, Claudio Sterle
, Igor Vasil'ev
:
A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes. 43-58 - Yannis Marinakis, Magdalene Marinaki:
A Particle Swarm Optimization Algorithm with Path Relinking for the Location Routing Problem. 59-78 - Julius Tumwiine
, Stephan Luckhaus, J. Y. T. Mugisha, Livingstone S. Luboobi
:
An Age-structured Mathematical Model for the Within Host Dynamics of Malaria and the Immune System. 79-97
Volume 7, Number 2, June 2008
- Laetitia Jourdan
, El-Ghazali Talbi:
Guest Editorial - Special Issue on Metaheuristics. 99-100 - Dalila Boughaci
, Belaid Benhamou, Habiba Drias
:
Scatter Search and Genetic Algorithms for MAX-SAT Problems. 101-124 - Hend Bouziri, El-Ghazali Talbi, Khaled Mellouli:
A Cooperative Search Method for the k-Coloring Problem. 125-142 - Saïd Hanafi, Christophe Wilbaut
:
Scatter Search for the 0-1 Multidimensional Knapsack Problem. 143-159 - Jaber Jemai
, Khaled Mellouli:
A Neural-Tabu Search Heuristic for the Real Time Vehicle Routing Problem. 161-176 - Nicolas Jozefowiez, Fred W. Glover, Manuel Laguna:
Multi-objective Meta-heuristics for the Traveling Salesman Problem with Profits. 177-195 - Marie-Ange Manier, Sid Lamrous:
An Evolutionary Approach for the Design and Scheduling of Electroplating Facilities. 197-215 - Fatos Xhafa
, Enrique Alba
, Bernabé Dorronsoro
, Bernat Duran:
Efficient Batch Job Scheduling in Grids Using Cellular Memetic Algorithms. 217-236 - Daniel Merkle, Martin Middendorf, Alexander Scheidler:
Self-Organized Task Allocation for Service Tasks in Computing Systems with Reconfigurable Components. 237-254
Volume 7, Number 3, September 2008
- K. Subramani
, C. Tauras, David Owen:
Fault Tolerant Sorting - Theoretical and Empirical Analyses of the Randomized QuickMergesort Algorithm. 255-276 - Mohamed Naceur Azaiez
:
Modeling Optimal Allocation of Deficit Irrigation: Application to Crop Production in Saudi Arabia. 277-289 - Toufik Mansour
, Ghalib Nassar:
Gray Codes, Loopless Algorithm and Partitions. 291-310 - Roberto Montemanni
, Derek H. Smith
:
Construction of Constant GC-Content DNA Codes via a Variable Neighbourhood Search Algorithm. 311-326
Volume 7, Number 4, December 2008
- John A. Keane, Hujun Yin, Victor J. Rayward-Smith:
Special Issue Arising from the IDEAL 2007 Conference. 327-328 - Lars Gräning, Stefan Menzel, Martina Hasenjäger
, Thomas Bihrer, Markus Olhofer, Bernhard Sendhoff
:
Knowledge Extraction from Aerodynamic Design Data and its Application to 3D Turbine Blade Geometries. 329-350 - Ágnes Vathy-Fogarassy
, Agnes Werner-Stark, János Abonyi:
Topology Representing Networks for the Visualization of Manifolds. 351-370 - Iván Olier
, Alfredo Vellido:
Variational Bayesian Generative Topographic Mapping. 371-387 - Haytham Elghazel, Hamamache Kheddouci, Véronique Deslandres, Alain Dussauchoy:
A Graph b-coloring Framework for Data Clustering. 389-423 - Shireen Mohd Zaki, Hujun Yin
:
A Semi-Supervised Learning Algorithm for Growing Neural Gas in Face Recognition. 425-435
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.