default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Mathematical Modelling and Algorithms, Volume 3
Volume 3, Number 1, March 2004
- Pasquale Avella
, Maurizio Boccia, Antonio Sforza:
Resource Constrained Shortest Path Problems in Path Planning for Fleet Management. 1-17 - Sean D. Brooks, M. F. Mahmood, J. A. Donaldson:
Numerical Modeling of Solitons in a Low Birefringent Optical Fiber. 19-29 - Michael Segal:
Planar Maximum Box Problem. 31-38 - Elise Miller-Hooks, Sarah Stock Patterson:
On Solving Quickest Time Problems in Time-Dependent, Dynamic Networks. 39-71 - Philippe Galinier, Jin-Kao Hao:
A General Approach for Constraint Solving by Local Search. 73-88 - Kenneth Sörensen:
Finding Robust Solutions Using Local Search. 89-103
Volume 3, Number 2, June 2004
- Huub M. M. ten Eikelder, A. A. van Erk:
Unification of some Least Squares Clustering Methods. 105-122 - Jatinder N. D. Gupta, Volker Lauff, Frank Werner:
Two-Machine Flow Shop Scheduling with Nonregular Criteria. 123-151 - Petrica C. Pop:
New Models of the Generalized Minimum Spanning Tree Problem. 153-166 - Ian M. Whittley, George D. Smith:
The Attribute Based Hill Climber. 167-178
Volume 3, Number 3, September 2004
- Ibrahim H. Osman, Khalil S. Hindi:
Editorial. 179-181 - Carlos Gomes da Silva, João C. N. Clímaco, José Rui Figueira:
A Scatter Search Method for the Bi-Criteria Multi-dimensional {0, 1}-Knapsack Problem using Surrogate Relaxation. 183-208 - Gianpaolo Ghiani, Francesca Guerriero, Gilbert Laporte, Roberto Musmanno:
Tabu Search Heuristics for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions. 209-223 - Robert H. Currie, Saïd Salhi:
A Tabu Search Heuristic for a Full-Load, Multi-Terminal, Vehicle Scheduling Problem with Backhauling and Time Windows. 225-243 - Chin-Wei Bong, Wang Yin Chai:
A Multiobjective Hybrid Metaheuristic Approach for GIS-based Spatial Zoning Model. 245-261 - Jingpeng Li, Raymond S. K. Kwan:
A Meta-heuristic with Orthogonal Experiment for the Set Covering Problem. 263-283 - Christian Blum, Michael Sampels:
An Ant Colony Optimization Algorithm for Shop Scheduling Problems. 285-308
Volume 3, Number 4, December 2004
- Jens Gottlieb, Emma Hart, Martin Middendorf, Günther R. Raidl, Colin Reeves:
Editorial. 311-312 - Christian Igel, Marc Toussaint:
A No-Free-Lunch theorem for non-uniform distributions of target functions. 313-322 - Mikkel T. Jensen:
Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation. 323-347 - Jens Scharnow, Karsten Tinnefeld, Ingo Wegener:
The analysis of evolutionary algorithms on sorting and shortest paths problems. 349-366 - Tommaso Schiavinotto, Thomas Stützle:
The linear ordering problem: Instances, search space analysis and algorithms. 367-402 - Jürgen Branke, Michael Guntsch:
Solving the Probabilistic TSP with Ant Colony Optimization. 403-425
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.
last updated on 2025-02-21 19:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
