default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Merz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i2]Kimberley Parsons Trommler, Matthias Hafner, Wolfgang Kellerer, Peter Merz, Sigurd Schuster, Josef Urban, Uwe Baeder, Bertram Gunzelmann, Andreas Kornbichler:
Six Questions about 6G. CoRR abs/2201.12266 (2022)- [i1]Kimberley Parsons Trommler, Matthias Hafner, Wolfgang Kellerer
, Peter Merz, Sigurd Schuster, Josef Urban, Uwe Baeder, Bertram Gunzelmann, Andreas Kornbichler:
PREVIEW VERSION: Six Insights into 6G: Orientation and Input for Developing Your Strategic 6G Research Plan. CoRR abs/2203.13094 (2022)
2010 – 2019
- 2014
- [j8]Peter Merz:
Sichere mobile Unternehmensanwendungen. HMD Prax. Wirtsch. 51(1): 45-55 (2014) - 2012
- [p3]Peter Merz:
Memetic Algorithms and Fitness Landscapes in Combinatorial Optimization. Handbook of Memetic Algorithms 2012: 95-119 - 2011
- [e2]Peter Merz, Jin-Kao Hao:
Evolutionary Computation in Combinatorial Optimization - 11th European Conference, EvoCOP 2011, Torino, Italy, April 27-29, 2011. Proceedings. Lecture Notes in Computer Science 6622, Springer 2011, ISBN 978-3-642-20363-3 [contents] - 2010
- [c38]Steffen Wolf, Peter Merz:
Efficient Cycle Search for the Minimum Routing Cost Spanning Tree Problem. EvoCOP 2010: 276-287 - [e1]Peter I. Cowling, Peter Merz:
Evolutionary Computation in Combinatorial Optimization, 10th European Conference, EvoCOP 2010, Istanbul, Turkey, April 7-9, 2010. Proceedings. Lecture Notes in Computer Science 6022, Springer 2010, ISBN 978-3-642-12138-8 [contents]
2000 – 2009
- 2009
- [j7]Thomas Fischer, Kerstin Bauer, Peter Merz:
Solving the routing and wavelength assignment problem with a multilevel distributed memetic algorithm. Memetic Comput. 1(2): 101-123 (2009) - [c37]Steffen Wolf, Peter Merz:
Iterated Local Search for Minimum Power Symmetric Connectivity in Wireless Networks. EvoCOP 2009: 192-203 - [c36]Steffen Wolf, Tom Ansay, Peter Merz:
A Distributed Range Assignment Protocol. IWSOS 2009: 226-231 - 2008
- [c35]Mathias Dalheimer, Franz-Josef Pfreundt, Peter Merz:
Formal Verification of a Grid Resource Allocation Protocol. CCGRID 2008: 332-339 - [c34]Peter Merz, Jan Ubben, Matthias Priebe:
On the Construction of a Super-Peer Topology underneath Middleware for Distributed Computing. CCGRID 2008: 590-595 - [c33]Steffen Wolf, Peter Merz:
Evolutionary Local Search for the Minimum Energy Broadcast Problem. EvoCOP 2008: 61-72 - [c32]Kerstin Bauer, Thomas Fischer, Sven Oliver Krumke, Katharina Gerhardt, Stephan Westphal, Peter Merz:
Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem. EvoCOP 2008: 158-169 - [c31]Peter Merz, Matthias Priebe, Steffen Wolf:
Super-Peer Selection in Peer-to-Peer Networks Using Network Coordinates. ICIW 2008: 385-390 - [c30]Peter Merz, Steffen Wolf, Dennis Schwerdel, Matthias Priebe:
A Self-Organizing Super-Peer Overlay with a Chord Core for Desktop Grids. IWSOS 2008: 23-34 - [c29]Peter Merz, Matthias Priebe, Steffen Wolf:
A Simulation Framework for Distributed Super-Peer Topology Construction Using Network Coordinates. PDP 2008: 491-498 - [c28]Thomas Fischer, Kerstin Bauer, Peter Merz:
A Distributed Memetic Algorithm for the Routing and Wavelength Assignment Problem. PPSN 2008: 879-888 - [c27]Peter Merz, Jutta Huhse:
An Iterated Local Search Approach for Finding Provably Good Solutions for Very Large TSP Instances. PPSN 2008: 929-939 - [c26]Thomas Fischer, Kerstin Bauer, Peter Merz:
A Multilevel Approach for the Routing and Wavelength Assignment Problem. SAINT 2008: 225-228 - [p2]Thomas Fischer, Peter Merz:
Reducing the Size of Travelling Salesman Problem Instances by Fixing Edges. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 243-258 - 2007
- [j6]Peter Merz, Katja Gorunova:
Fault-tolerant Resource Discovery in Peer-to-peer Grids. J. Grid Comput. 5(3): 319-335 (2007) - [c25]Thomas Fischer, Peter Merz:
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges. EvoCOP 2007: 72-83 - [c24]Steffen Wolf, Peter Merz:
A Hybrid Method for Solving Large-Scale Supply Chain Problems. EvoCOP 2007: 219-228 - [c23]Steffen Wolf, Peter Merz:
Evolutionary Local Search for the Super-Peer Selection Problem and the p -Hub Median Problem. Hybrid Metaheuristics 2007: 1-15 - [c22]Thomas Fischer, Peter Merz:
A Memetic Algorithm for the Optimum Communication Spanning Tree Problem. Hybrid Metaheuristics 2007: 170-184 - [c21]Peter Merz, Matthias Priebe:
A New Iterative Method to Improve Network Coordinates-Based Internet Distance Estimation. ISPDC 2007: 169-176 - [c20]Sameh Al-Shihabi, Peter Merz, Steffen Wolf:
Nested Partitioning for the Minimum Energy Broadcast Problem. LION 2007: 1-11 - [c19]Sven Oliver Krumke, Peter Merz, Tim Nonner, Katharina Rupp:
Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs. OPODIS 2007: 159-173 - [p1]Thomas Fischer, Peter Merz:
Embedding a Chained Lin-Kernighan Algorithm into a Distributed Algorithm. Metaheuristics 2007: 277-295 - 2006
- [c18]Thomas Fischer, Stephan Fudeus, Peter Merz:
A Middleware for Job Distribution in Peer-to-Peer Networks. PARA 2006: 1147-1157 - [c17]Peter Merz, Steffen Wolf:
Evolutionary Local Search for Designing Peer-to-Peer Overlay Topologies Based on Minimum Routing Cost Spanning Trees. PPSN 2006: 272-281 - 2005
- [c16]Peter Merz, Katja Gorunova:
Efficient broadcast in P2P grids. CCGRID 2005: 237-242 - [c15]Mathias Dalheimer, Franz-Josef Pfreundt, Peter Merz:
Calana: a general-purpose agent-based grid scheduler. HPDC 2005: 279-280 - [c14]Thomas Fischer, Peter Merz:
A Distributed Chained Lin-Kernighan Algorithm for TSP Problems. IPDPS 2005 - [c13]Mathias Dalheimer, Franz-Josef Pfreundt, Peter Merz:
Agent-Based Grid Scheduling with Calana. PPAM 2005: 741-750 - [c12]Peter Merz, Katja Gorunova:
Reliable Multicast and Its Probabilistic Model for Job Submission in Peer-to-Peer Grids. WISE 2005: 504-511 - 2004
- [j5]Peter Merz:
Advanced Fitness Landscape Analysis and the Performance of Memetic Algorithms. Evol. Comput. 12(3): 303-325 (2004) - 2003
- [c11]Nora Speer, Peter Merz, Christian Spieth, Andreas Zell:
Clustering gene expression data with memetic algorithms based on minimum spanning trees. IEEE Congress on Evolutionary Computation 2003: 1848-1855 - [c10]Peter Merz:
An Iterated Local Search Approach for Minimum Sum-of-Squares Clustering. IDA 2003: 286-296 - 2002
- [j4]Peter Merz, Bernd Freisleben:
Memetic Algorithms for the Traveling Salesman Problem. Complex Syst. 13(4) (2002) - [j3]Peter Merz, Bernd Freisleben:
Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming. J. Heuristics 8(2): 197-213 (2002) - [c9]Peter Merz:
A Comparison Of Memetic Recombination Operators For The Traveling Salesman Problem. GECCO 2002: 472-479 - [c8]Jutta Huhse, Thomas Villmann, Peter Merz, Andreas Zell:
Evolution Strategy with Neighborhood Attraction Using a Neural Gas Approach. PPSN 2002: 391-400 - [c7]Peter Merz, Andreas Zell:
Clustering Gene Expression Profiles with Memetic Algorithms. PPSN 2002: 811-820 - 2000
- [b1]Peter Merz:
Memetic algorithms for combinatorial optimization problems : fitness landscapes and effective search strategies. Siegen University, Germany, 2000 - [j2]Peter Merz, Bernd Freisleben:
Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning. Evol. Comput. 8(1): 61-91 (2000) - [j1]Peter Merz, Bernd Freisleben:
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans. Evol. Comput. 4(4): 337-352 (2000)
1990 – 1999
- 1999
- [c6]Peter Merz, Bernd Freisleben:
A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem. CEC 1999: 2063-2070 - 1998
- [c5]Peter Merz, Bernd Freisleben:
Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem. PPSN 1998: 765-774 - 1997
- [c4]Peter Merz, Bernd Freisleben:
Genetic local search for the TSP: new results. ICEC 1997: 159-164 - [c3]Peter Merz, Bernd Freisleben:
A Genetic Local Search Approach to the Quadratic Assignment Problem. ICGA 1997: 465-472 - 1996
- [c2]Bernd Freisleben, Peter Merz:
A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems. International Conference on Evolutionary Computation 1996: 616-621 - [c1]Bernd Freisleben, Peter Merz:
New Genetic Local Search Operators for the Traveling Salesman Problem. PPSN 1996: 890-899
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-07 20:45 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:
