default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilipp Hungerländer
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]Sarah Frisch, Philipp Hungerländer, Anna Jellen, Manuel Lackenbucher, Bernhard Primas, Sebastian Steininger
:
Integrated freight car routing and train scheduling. Central Eur. J. Oper. Res. 31(2): 417-443 (2023)- [j16]Mirko Dahlbeck, Anja Fischer, Frank Fischer, Philipp Hungerländer, Kerstin Maier:
Exact approaches for the combined cell layout problem. Eur. J. Oper. Res. 305(2): 530-546 (2023) - 2022
- [j15]Christian Truden, Kerstin Maier, Anna Jellen, Philipp Hungerländer:
Computational Approaches for Grocery Home Delivery Services. Algorithms 15(4): 125 (2022) - 2021
- [j14]Paul Alexandru Bucur, Philipp Armbrust, Philipp Hungerländer:
On the propagation of quality requirements for mechanical assemblies in industrial manufacturing. Expert Syst. Appl. 174: 114608 (2021) - 2020
- [j13]Christian Wankmüller, Christian Truden, Christopher Korzen, Philipp Hungerländer, Ewald Kolesnik, Gerald Reiner:
Optimal allocation of defibrillator drones in mountainous regions. OR Spectr. 42(3): 785-814 (2020) - [c21]Matthias Rößler, Matthias Wastian, Anna Jellen, Sarah Frisch, Dominic Weinberger, Philipp Hungerländer, Martin Bicher, Niki Popper:
Simulation And Optimization Of Traction Unit Circulations. WSC 2020: 90-101 - [i3]Konstantin Posch, Christian Truden, Philipp Hungerländer, Jürgen Pilz:
A Bayesian Approach for Predicting Food and Beverage Sales in Staff Canteens and Restaurants. CoRR abs/2005.12647 (2020)
2010 – 2019
- 2019
- [j12]Anja Fischer, Frank Fischer, Philipp Hungerländer:
New exact approaches to row layout problems. Math. Program. Comput. 11(4): 703-754 (2019) - [c20]Günther Cwioro, Philipp Hungerländer, Kerstin Maier, Jörg Pöcher, Christian Truden:
An Optimization Approach to the Ordering Phase of an Attended Home Delivery Service. CPAIOR 2019: 208-224 - [c19]Paul Alexandru Bucur, Philipp Hungerländer:
Canonical Correlation Analysis Framework for the Reduction of Test Time in Industrial Manufacturing Quality Tests. EANN 2019: 323-334 - [c18]Philipp Hungerländer, Anna Jellen, Stefan Jessenitschnig, Lisa Knoblinger, Manuel Lackenbucher, Kerstin Maier:
Solving the Multiple Traveling Salesperson Problem on Regular Grids in Linear Time. OR 2019: 215-221 - [c17]Jessica Hautz, Philipp Hungerländer, Tobias Lechner, Kerstin Maier, Peter Rescher:
The Weighted Linear Ordering Problem. OR 2019: 223-229 - [i2]Christoph Hertrich, Philipp Hungerländer, Christian Truden:
Sweep Algorithms for the Capacitated Vehicle Routing Problem with Structured Time Window. CoRR abs/1901.02771 (2019) - [i1]Christian Wankmüller, Christian Truden, Christopher Korzen, Philipp Hungerländer, Ewald Kolesnik, Gerald Reiner:
Base Station Allocation of Defibrillator Drones in Mountainous Regions. CoRR abs/1902.06685 (2019) - 2018
- [j11]Miguel F. Anjos, Anja Fischer, Philipp Hungerländer:
Improved exact approaches for row layout problems with departments of equal length. Eur. J. Oper. Res. 270(2): 514-529 (2018) - [c16]Miguel F. Anjos, Philipp Hungerländer, Kerstin Maier:
An Integer Linear Programming Approach for the Combined Cell Layout Problem. IEEM 2018: 705-709 - [c15]Philipp Armbrust, Philipp Hungerländer, Anna Jellen:
A Heuristic for the Traveling Salesperson Problem with Forbidden Neighborhoods on Regular 2D and 3D Grids. OR 2018: 95-101 - [c14]Sarah Frisch, Philipp Hungerländer, Anna Jellen, Dominic Weinberger:
A Mixed Integer Linear Program for Optimizing the Utilization of Locomotives with Maintenance Constraints. OR 2018: 103-109 - [c13]Christoph Hertrich, Philipp Hungerländer, Christian Truden:
Sweep Algorithms for the Capacitated Vehicle Routing Problem with Structured Time Windows. OR 2018: 127-133 - [c12]Philipp Hungerländer, Sebastian Steininger:
Fleet Sizing and Empty Freight Car Allocation. OR 2018: 285-290 - [c11]Paul Alexandru Bucur, Klaus Frick, Philipp Hungerländer:
Predicting the Vibroacoustic Quality of Steering Gears. OR 2018: 309-315 - 2017
- [j10]Philipp Hungerländer:
New semidefinite programming relaxations for the Linear Ordering and the Traveling Salesman Problem. Discret. Appl. Math. 217: 19-39 (2017) - [j9]Anja Fischer, Philipp Hungerländer:
The traveling salesman problem on grids with forbidden neighborhoods. J. Comb. Optim. 34(3): 891-915 (2017) - [c10]Philipp Hungerländer, Kerstin Maier:
The Multiple Checkpoint Ordering Problem. OR 2017: 171-177 - [c9]Michael Firstein, Anja Fischer, Philipp Hungerländer:
Closed Almost Knight's Tours on 2D and 3D Chessboards. OR 2017: 185-190 - [c8]Anja Fischer, Philipp Hungerländer, Anna Jellen:
The Traveling Salesperson Problem with Forbidden Neighborhoods on Regular 3D Grids. OR 2017: 213-219 - 2016
- [c7]M. Aschinger, S. Applebee, A. Bucur, H. Edmonds, Philipp Hungerländer, Kerstin Maier:
New Constraints and Features for the University Course Timetabling Problem. OR 2016: 95-101 - [c6]Philipp Hungerländer, Kerstin Maier, Jörg Pöcher, Andrea Rendl, Christian Truden:
Solving an On-Line Capacitated Vehicle Routing Problem with Structured Time Windows. OR 2016: 127-132 - 2015
- [j8]Philipp Hungerländer, Miguel F. Anjos:
A semidefinite optimization-based approach for global optimization of multi-row facility layout. Eur. J. Oper. Res. 245(1): 46-61 (2015) - [j7]Philipp Hungerländer:
A semidefinite optimization approach to the Target Visitation Problem. Optim. Lett. 9(8): 1703-1727 (2015) - [j6]Philipp Hungerländer, Franz Rendl:
A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds. SIAM J. Optim. 25(3): 1633-1659 (2015) - [c5]Anja Fischer, Frank Fischer, Philipp Hungerländer:
A New Exact Approach to the Space-Free Double Row Layout Problem. OR 2015: 125-130 - 2014
- [c4]Miguel F. Anjos, Anja Fischer, Philipp Hungerländer:
Solution Approaches for the Double-Row Equidistant Facility Layout Problem. OR 2014: 17-23 - 2013
- [j5]Philipp Hungerländer, Franz Rendl:
A computational study and survey of methods for the single-row facility layout problem. Comput. Optim. Appl. 55(1): 1-20 (2013) - [j4]Markus Chimani, Philipp Hungerländer:
Exact Approaches to Multilevel Vertical Orderings. INFORMS J. Comput. 25(4): 611-624 (2013) - [j3]Markus Chimani, Philipp Hungerländer:
Multi-level Verticality Optimization: Concept, Strategies, and Drawing Scheme. J. Graph Algorithms Appl. 17(3): 329-362 (2013) - [j2]Philipp Hungerländer, Franz Rendl:
Semidefinite relaxations of ordering problems. Math. Program. 140(1): 77-97 (2013) - [c3]Philipp Hungerländer:
A Semidefinite Optimization Approach to the Directed Circular Facility Layout Problem. MIM 2013: 2033-2038 - 2012
- [c2]Philipp Hungerländer, Miguel F. Anjos:
An Exact Approach for the Combined Cell Layout Problem. OR 2012: 275-281 - 2011
- [j1]Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel:
An SDP approach to multi-level crossing minimization. ACM J. Exp. Algorithmics 17(1) (2011) - [c1]Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel:
An SDP Approach to Multi-level Crossing Minimization. ALENEX 2011: 116-126
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-05-08 20: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
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:
