The SCEAS System
| |||||||

## Search the dblp DataBase
Christian Blum:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Andrea Roli, Christian Blum
**Critical Parallelization of Local Search for MAX-SAT.**[Citation Graph (0, 0)][DBLP] AI*IA, 2001, pp:147-158 [Conf] - Jürgen Rahmel, Christian Blum, Peter Hahn, Björn Krapohl
**Diagnosis and Monitoring of Ulnar Nerve Lesions.**[Citation Graph (0, 0)][DBLP] AIME, 1997, pp:211-222 [Conf] - Christian Blum
**ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification.**[Citation Graph (0, 0)][DBLP] Ant Algorithms, 2002, pp:14-27 [Conf] - Christian Blum, Joaquín Bautista, Jordi Pereira
**Beam-ACO Applied to Assembly Line Balancing.**[Citation Graph (0, 0)][DBLP] ANTS Workshop, 2006, pp:96-107 [Conf] - Christian Blum, Marco Dorigo
**Deception in Ant Colony Optimization.**[Citation Graph (0, 0)][DBLP] ANTS Workshop, 2004, pp:118-129 [Conf] - Maria J. Blesa, Christian Blum
**Ant Colony Optimization for the Maximum Edge-Disjoint Paths Problem.**[Citation Graph (0, 0)][DBLP] EvoWorkshops, 2004, pp:160-169 [Conf] - Christian Blum, Carlos Cotta, Antonio J. Fernández, José E. Gallardo
**A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem.**[Citation Graph (0, 0)][DBLP] EvoCOP, 2007, pp:36-47 [Conf] - Christian Blum
**Ant Colony Optimization For The Edge-weighted k-cardinality Tree Problem.**[Citation Graph (0, 0)][DBLP] GECCO, 2002, pp:27-34 [Conf] - Christian Blum
**A new hybrid evolutionary algorithm for the huge**[Citation Graph (0, 0)][DBLP]*k*-cardinality tree problem. GECCO, 2006, pp:515-522 [Conf] - Christian Blum, Michael Sampels, Mark Zlochin
**On A Particularity In Model-based Search.**[Citation Graph (0, 0)][DBLP] GECCO, 2002, pp:35-42 [Conf] - Christian Blum, Krzysztof Socha
**Training feed-forward neural networks with ant colony optimization: An application to pattern classification.**[Citation Graph (0, 0)][DBLP] HIS, 2005, pp:233-238 [Conf] - Christian Blum, Mateu Yábar Vallès
**Multi-level Ant Colony Optimization for DNA Sequencing by Hybridization.**[Citation Graph (0, 0)][DBLP] Hybrid Metaheuristics, 2006, pp:94-109 [Conf] - Jürgen Rahmel, Christian Blum, Peter Hahn
**On the Role of Hierarchy for Neural Network Interpretation.**[Citation Graph (0, 0)][DBLP] IJCAI, 1997, pp:1072-1077 [Conf] - Maria J. Blesa, Christian Blum
**A nature-inspired algorithm for the disjoint paths problem.**[Citation Graph (0, 0)][DBLP] IPDPS, 2006, pp:- [Conf] - Christian Blum, Maria J. Blesa
**Combining Ant Colony Optimization with Dynamic Programming for Solving the k-Cardinality Tree Problem.**[Citation Graph (0, 0)][DBLP] IWANN, 2005, pp:25-33 [Conf] - Jürgen Rahmel, Christian Blum, Peter Hahn
**Interpretation of a Hierarchical Neural Network.**[Citation Graph (0, 0)][DBLP] IWANN, 1997, pp:651-659 [Conf] - Christian Blum, Michael Sampels
**When Model Bias Is Stronger than Selection Pressure.**[Citation Graph (0, 0)][DBLP] PPSN, 2002, pp:893-902 [Conf] - Michael Sampels, Christian Blum, Monaldo Mastrolilli, Olivia Rossi-Doria
**Metaheuristics for Group Shop Scheduling.**[Citation Graph (0, 0)][DBLP] PPSN, 2002, pp:631-640 [Conf] - Christian Blum, Mateu Yábar Vallès
**New Constructive Heuristics for DNA Sequencing by Hybridization.**[Citation Graph (0, 0)][DBLP] WABI, 2006, pp:355-365 [Conf] - Christian Blum
**M. Dorigo and T. Stützle, Ant Colony Optimization.**[Citation Graph (0, 0)][DBLP] Artif. Intell., 2005, v:165, n:2, pp:261-264 [Journal] - Christian Blum
**Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2005, v:32, n:, pp:1565-1591 [Journal] - Christian Blum, Maria J. Blesa
**New metaheuristic approaches for the edge-weighted**[Citation Graph (0, 0)][DBLP]*k*-cardinality tree problem. Computers & OR, 2005, v:32, n:, pp:1355-1377 [Journal] - Christian Blum, Andrea Roli
**Metaheuristics in combinatorial optimization: Overview and conceptual comparison.**[Citation Graph (0, 0)][DBLP] ACM Comput. Surv., 2003, v:35, n:3, pp:268-308 [Journal] - Christian Blum, Matthias Ehrgott
**Local Search Algorithms for the k-cardinality Tree Problem.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:128, n:2-3, pp:511-540 [Journal] - Daniel Merkle, Christian Blum
**Swarm Intelligence - An Optimization-Based Introduction.**[Citation Graph (0, 0)][DBLP] KI, 2005, v:19, n:4, pp:5-10 [Journal] - Marco Dorigo, Christian Blum
**Ant colony optimization theory: A survey.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:344, n:2-3, pp:243-278 [Journal] - Christian Blum, Marco Dorigo
**Search bias in ant colony optimization: on the role of competition-balanced systems.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Evolutionary Computation, 2005, v:9, n:2, pp:159-174 [Journal] - Christian Blum
**Revisiting dynamic programming for finding optimal subtrees in trees.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:177, n:1, pp:102-115 [Journal] - Francisco Luna, Christian Blum, Enrique Alba, Antonio J. Nebro
**ACO vs EAs for solving a real-world frequency assignment problem in GSM networks.**[Citation Graph (0, 0)][DBLP] GECCO, 2007, pp:94-101 [Conf] - Christian Blum, Monaldo Mastrolilli
**Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge.**[Citation Graph (0, 0)][DBLP] Hybrid Metaheuristics, 2007, pp:123-139 [Conf] - Christian Blum, Maria J. Blesa
**Probabilistic Beam Search for the Longest Common Subsequence Problem.**[Citation Graph (0, 0)][DBLP] SLS, 2007, pp:150-161 [Conf] - Krzysztof Socha, Christian Blum
**An ant colony optimization algorithm for continuous optimization: application to feed-forward neural network training.**[Citation Graph (0, 0)][DBLP] Neural Computing and Applications, 2007, v:16, n:3, pp:235-247 [Journal] **Emergent Sorting in Networks of Router Agents.**[Citation Graph (, )][DBLP]**Ant Colony Optimization for Energy-Efficient Broadcasting in Ad-Hoc Networks.**[Citation Graph (, )][DBLP]**An Extended Beam-ACO Approach to the Time and Space Constrained Simple Assembly Line Balancing Problem.**[Citation Graph (, )][DBLP]**Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows.**[Citation Graph (, )][DBLP]**Self-synchronized duty-cycling in sensor networks with energy harvesting capabilities: the static network case.**[Citation Graph (, )][DBLP]**Ant colony optimization.**[Citation Graph (, )][DBLP]**Ant Colony Optimization: Introduction and Hybridizations.**[Citation Graph (, )][DBLP]**Hybridizing Beam-ACO with Constraint Programming for Single Machine Job Scheduling.**[Citation Graph (, )][DBLP]**Tabu Search for the Founder Sequence Reconstruction Problem: A Preliminary Study.**[Citation Graph (, )][DBLP]**Reconstructing Geometrically Consistent Tree Structures from Noisy Images.**[Citation Graph (, )][DBLP]**Beam-ACO Based on Stochastic Sampling: A Case Study on the TSP with Time Windows.**[Citation Graph (, )][DBLP]**A Randomized Iterated Greedy Algorithm for the Founder Sequence Reconstruction Problem.**[Citation Graph (, )][DBLP]**An ant colony optimization algorithm for DNA sequencing by hybridization.**[Citation Graph (, )][DBLP]**Beam search for the longest common subsequence problem.**[Citation Graph (, )][DBLP]**Beam-ACO for the travelling salesman problem with time windows.**[Citation Graph (, )][DBLP]**Hybrid Metaheuristics.**[Citation Graph (, )][DBLP]**On solving the assembly line worker assignment and balancing problem via beam search.**[Citation Graph (, )][DBLP]
Search in 0.014secs, Finished in 0.016secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |