default search action
Peter M. Hahn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [i1]Alexandre Domingues Gonçalves, Lúcia Maria de A. Drummond, Artur Alves Pessoa, Peter M. Hahn:
Improving Lower Bounds for the Quadratic Assignment Problem by applying a Distributed Dual Ascent Algorithm. CoRR abs/1304.0267 (2013) - 2012
- [j15]Peter M. Hahn, Yi-Rong Zhu, Monique Guignard, William L. Hightower, Matthew J. Saltzman:
A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem. INFORMS J. Comput. 24(2): 202-209 (2012) - 2010
- [j14]Peter M. Hahn, J. MacGregor Smith, Yi-Rong Zhu:
The Multi-Story Space Assignment Problem. Ann. Oper. Res. 179(1): 77-103 (2010) - [j13]Bum-Jin Kim, William L. Hightower, Peter M. Hahn, Yi-Rong Zhu, Lu Sun:
Lower bounds for the axial three-index assignment problem. Eur. J. Oper. Res. 202(3): 654-668 (2010) - [j12]Artur Alves Pessoa
, Peter M. Hahn, Monique Guignard, Yi-Rong Zhu:
Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique. Eur. J. Oper. Res. 206(1): 54-63 (2010) - [j11]Peter M. Hahn, Yi-Rong Zhu, Monique Guignard, J. MacGregor Smith:
Exact solution of emerging quadratic assignment problems. Int. Trans. Oper. Res. 17(5): 525-552 (2010) - [j10]Peter M. Hahn, Matthew J. Saltzman:
A New Branch-and-Bound Solver for the Quadratic Assignment Problem Based on the Level-3 Reformulation-Linearization Technique. Stud. Inform. Univ. 8(2): 97-106 (2010)
2000 – 2009
- 2008
- [j9]Peter M. Hahn, Bum-Jin Kim, Monique Guignard, J. MacGregor Smith, Yi-Rong Zhu:
An algorithm for the generalized quadratic assignment problem. Comput. Optim. Appl. 40(3): 351-372 (2008) - [j8]Peter M. Hahn, Bum-Jin Kim, Thomas Stützle
The quadratic three-dimensional assignment problem: Exact and approximate solution methods. Eur. J. Oper. Res. 184(2): 416-428 (2008) - 2007
- [j7]Warren P. Adams, Monique Guignard, Peter M. Hahn, William L. Hightower:
A level-2 reformulation-linearization technique bound for the quadratic assignment problem. Eur. J. Oper. Res. 180(3): 983-996 (2007) - 2005
- [j6]Zvi Drezner, Peter M. Hahn, Éric D. Taillard:
Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods. Ann. Oper. Res. 139(1): 65-94 (2005) - [j5]Harvind Samra, Zhi Ding
Symbol mapping diversity design for multiple packet transmissions. IEEE Trans. Commun. 53(5): 810-817 (2005) - 2003
- [c2]Harvind Samra, Zhi Ding, Peter M. Hahn:
Symbol mapping diversity design for packet retransmissions through fading channels. GLOBECOM 2003: 1989-1993 - [c1]Harvind Samra, Zhi Ding, Peter M. Hahn:
Optimal symbol mapping diversity for multiple packet transmissions. ICASSP (4) 2003: 181-184 - 2001
- [j4]Peter M. Hahn, Jakob Krarup:
A hospital facility layout problem finally solved. J. Intell. Manuf. 12(5-6): 487-496 (2001)
1990 – 1999
- 1990
- [j3]Robert J. Wolfe, Michel C. Jeruchim, Peter M. Hahn:
On optimum and suboptimum biasing procedures for importance sampling in communication simulation. IEEE Trans. Commun. 38(5): 639-647 (1990)
1980 – 1989
- 1989
- [j2]Michel C. Jeruchim, Peter M. Hahn, Kevin P. Smyntek, Robert T. Ray:
An experimental investigation of conventional and efficient importance sampling. IEEE Trans. Commun. 37(6): 578-587 (1989) - 1987
- [j1]Peter M. Hahn, Michel C. Jeruchim:
Developments in the Theory and Application of Importance Sampling. IEEE Trans. Commun. 35(7): 706-714 (1987)
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-09 13:19 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: