default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Greistorfer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Rostislav Stanek
, Peter Greistorfer, Anna Elisabeth Kastner:
Advanced optimization models for the location of charging stations in e-mobility. Central Eur. J. Oper. Res. 32(3): 737-761 (2024)- 2022
- [c1]Peter Greistorfer, Rostislav Stanek, Vittorio Maniezzo:
A Tabu Search Matheuristic for the Generalized Quadratic Assignment Problem. MIC 2022: 544-553 - 2020
- [j6]Andrea Borenich, Peter Greistorfer, Marc Reimann:
Model-based production cost estimation to support bid processes: an automotive case study. Central Eur. J. Oper. Res. 28(3): 841-868 (2020)
2010 – 2019
- 2019
- [j5]Rostislav Stanek, Peter Greistorfer, Klaus Ladner, Ulrich Pferschy:
Geometric and LP-based heuristics for angular travelling salesman problems in the plane. Comput. Oper. Res. 108: 97-111 (2019) - 2018
- [i1]Rostislav Stanek, Peter Greistorfer, Klaus Ladner, Ulrich Pferschy:
Geometric and LP-based heuristics for the quadratic travelling salesman problem. CoRR abs/1803.03681 (2018) - 2016
- [j4]J. Manuel Colmenar, Peter Greistorfer, Rafael Martí, Abraham Duarte:
Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem. Eur. J. Oper. Res. 252(2): 432-442 (2016)
2000 – 2009
- 2008
- [j3]Peter Greistorfer, Arne Løkketangen, Stefan Voß, David L. Woodruff:
Experiments concerning sequential versus simultaneous maximization of objective function and distance. J. Heuristics 14(6): 613-625 (2008) - 2007
- [e1]Karl F. Doerner, Michel Gendreau, Peter Greistorfer, Walter J. Gutjahr, Richard F. Hartl, Marc Reimann:
Metaheuristics. Operations Research/Computer Science Interfaces Series 39, Springer 2007, ISBN 978-0-387-71919-1 [contents] - 2006
- [j2]Peter Greistorfer, César Rego:
A simple filter-and-fan approach to the facility location problem. Comput. Oper. Res. 33: 2590-2601 (2006) - 2001
- [j1]Peter Greistorfer, Hans Kellerer:
Bounds and Tabu Search for a Cyclic Max-Min Scheduling Problem. J. Heuristics 7(4): 371-390 (2001)
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-08-05 20:22 CEST 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:
