default search action
Hermann Gehring
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2011
- [j8]Timo Kubach, Andreas Bortfeldt, Thomas Tilli, Hermann Gehring:
Greedy Algorithms for Packing Unequal Spheres into a Cuboidal Strip or a Cuboid. Asia Pac. J. Oper. Res. 28(6): 739-753 (2011) - 2009
- [j7]Timo Kubach, Andreas Bortfeldt, Hermann Gehring:
Parallel greedy algorithms for packing unequal circles into a strip or a rectangle. Central Eur. J. Oper. Res. 17(4): 461-477 (2009) - 2005
- [j6]Jörg Homberger, Hermann Gehring:
A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. Eur. J. Oper. Res. 162(1): 220-238 (2005) - [j5]Torsten Fischer, Hermann Gehring:
Planning vehicle transhipment in a seaport automobile terminal using a multi-agent system. Eur. J. Oper. Res. 166(3): 726-740 (2005) - 2003
- [j4]Andreas Bortfeldt, Hermann Gehring, Daniel Mack:
A parallel tabu search algorithm for solving the container loading problem. Parallel Comput. 29(5): 641-662 (2003) - 2002
- [j3]Hermann Gehring, Jörg Homberger:
Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows. J. Heuristics 8(3): 251-276 (2002) - 2001
- [j2]Andreas Bortfeldt, Hermann Gehring:
A hybrid genetic algorithm for the container loading problem. Eur. J. Oper. Res. 131(1): 143-161 (2001) - 1988
- [j1]Hermann Gehring, Herbert Kopfer:
Zur Praxisorientierung der universitären Ausbildung in Software Engineering. Angew. Inform. 30(6): 244-251 (1988)
Conference and Workshop Papers
- 2015
- [c9]Jörg Homberger, Hermann Gehring, Tobias Buer:
Integrating Side Payments into Collaborative Planning for the Distributed Multi-level Unconstrained Lot Sizing Problem. HICSS 2015: 1068-1077 - 2010
- [c8]Jörg Homberger, Hermann Gehring:
A Pheromone-Based Negotiation Mechanism for Lot-Sizing in Supply Chains. HICSS 2010: 1-10 - 2009
- [c7]Andrea Nagel, Giselher Pankratz, Hermann Gehring:
Tourenplanung in einer Distributionskooperation komplementärer Lieferanten. PBFT 2009: 281-292 - [c6]Jörg Homberger, Hermann Gehring:
An Ant Colony Optimization Approach for the Multi-Level Unconstrained Lot-Sizing Problem. HICSS 2009: 1-7 - 2008
- [c5]Jörg Homberger, Hermann Gehring:
A Two-Level Parallel Genetic Algorithm for the Uncapacitated Warehouse Location Problem. HICSS 2008: 67 - [c4]Axel Holland, Jörg Homberger, Hermann Gehring:
Untersuchung von Multipass-Strategien für das RCPSP/prax. Intelligente Systeme zur Entscheidungsunterstützung 2008: 33-48 - 2006
- [c3]Andreas Bortfeldt, Hermann Gehring:
New Large Benchmark Instances for the Two-Dimensional Strip Packing Problem with Rectangular Pieces. HICSS 2006 - 2001
- [c2]Jens Levenhagen, Andreas Bortfeldt, Hermann Gehring:
Path Tracing in Genetic Algorithms Applied to the Multiconstrained Knapsack Problem. EvoWorkshops 2001: 40-49 - 1991
- [c1]Stefan Bock, Hermann Gehring, Ralph Meyer:
FSS - Ein Projekt zur Modellierung und Simulation von Fertigungslinien im Automobilbau. ASIM 1991: 562-566
Informal and Other Publications
- 2012
- [i1]Tobias Buer, Jörg Homberger, Hermann Gehring:
A collaborative ant colony metaheuristic for distributed multi-level lot-sizing. CoRR abs/1204.0479 (2012)
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 2024-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint