default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Bortfeldt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j25]Andreas Bortfeldt, Junmin Yi
:
The Split Delivery Vehicle Routing Problem with three-dimensional loading constraints. Eur. J. Oper. Res. 282(2): 545-558 (2020)- [j24]Henriette Koch, Maximilian Schlögell, Andreas Bortfeldt:
A hybrid algorithm for the vehicle routing problem with three-dimensional loading constraints and mixed backhauls. J. Sched. 23(1): 71-93 (2020)
2010 – 2019
- 2018
- [j23]Dirk Männel, Andreas Bortfeldt:
Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban. Eur. J. Oper. Res. 264(1): 119-137 (2018) - [j22]Sebastian Reil, Andreas Bortfeldt, Lars Mönch:
Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints. Eur. J. Oper. Res. 266(3): 877-894 (2018) - [j21]Henriette Koch, Andreas Bortfeldt, Gerhard Wäscher:
A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints. OR Spectr. 40(4): 1029-1075 (2018) - 2017
- [j20]Ana Moura, Andreas Bortfeldt:
A two-stage packing problem procedure. Int. Trans. Oper. Res. 24(1-2): 43-58 (2017) - 2016
- [j19]Dirk Männel, Andreas Bortfeldt:
A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints. Eur. J. Oper. Res. 254(3): 840-858 (2016) - [c5]Junmin Yi, Andreas Bortfeldt:
The Capacitated Vehicle Routing Problem with Three-Dimensional Loading Constraints and Split Delivery - A Case Study. OR 2016: 351-356 - 2015
- [j18]Andreas Bortfeldt, Thomas Hahn, Dirk Männel, Lars Mönch:
Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints. Eur. J. Oper. Res. 243(1): 82-96 (2015) - 2013
- [j17]Andreas Bortfeldt, Jörg Homberger:
Packing first, routing second - a heuristic for the vehicle routing and loading problem. Comput. Oper. Res. 40(3): 873-885 (2013) - [j16]Andreas Bortfeldt:
A reduction approach for solving the rectangle packing area minimization problem. Eur. J. Oper. Res. 224(3): 486-496 (2013) - [j15]Andreas Bortfeldt, Gerhard Wäscher:
Constraints in container loading - A state-of-the-art review. Eur. J. Oper. Res. 229(1): 1-20 (2013) - 2012
- [j14]Andreas Bortfeldt, Sabine Jungmann:
A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint. Ann. Oper. Res. 196(1): 53-71 (2012) - [j13]Daniel Mack, Andreas Bortfeldt:
A heuristic for solving large bin packing problems in two and three dimensions. Central Eur. J. Oper. Res. 20(2): 337-354 (2012) - [j12]Florian Forster, Andreas Bortfeldt:
A tree search procedure for the container relocation problem. Comput. Oper. Res. 39(2): 299-309 (2012) - [j11]Andreas Bortfeldt:
A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints. Comput. Oper. Res. 39(9): 2248-2257 (2012) - [j10]Andreas Bortfeldt, Florian Forster:
A tree search procedure for the container pre-marshalling problem. Eur. J. Oper. Res. 217(3): 531-540 (2012) - 2011
- [j9]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) - [c4]Florian Forster, Andreas Bortfeldt:
A tree search heuristic for the container retrieval problem. OR 2011: 257-262 - 2010
- [j8]Tobias Fanslau, Andreas Bortfeldt:
A Tree Search Algorithm for Solving the Container Loading Problem. INFORMS J. Comput. 22(2): 222-235 (2010)
2000 – 2009
- 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) - [j6]Andreas Bortfeldt, Tobias Winter:
A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces. Int. Trans. Oper. Res. 16(6): 685-713 (2009) - 2008
- [c3]Andreas Bortfeldt, Tobias Winter:
Ein genetischer Algorithmus für das beschränkte zweidimensionale Knapsack-Problem ohne Guillotineschnitt-Bedingung. Intelligente Systeme zur Entscheidungsunterstützung 2008: 179-188 - 2007
- [j5]Andreas Bortfeldt, Daniel Mack:
A heuristic for the three-dimensional strip packing problem. Eur. J. Oper. Res. 183(3): 1267-1279 (2007) - 2006
- [j4]Andreas Bortfeldt:
A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. Eur. J. Oper. Res. 172(3): 814-837 (2006) - [c2]Andreas Bortfeldt, Hermann Gehring:
New Large Benchmark Instances for the Two-Dimensional Strip Packing Problem with Rectangular Pieces. HICSS 2006 - 2003
- [j3]Andreas Bortfeldt, Hermann Gehring, Daniel Mack:
A parallel tabu search algorithm for solving the container loading problem. Parallel Comput. 29(5): 641-662 (2003) - 2001
- [j2]Andreas Bortfeldt, Hermann Gehring:
A hybrid genetic algorithm for the container loading problem. Eur. J. Oper. Res. 131(1): 143-161 (2001) - [c1]Jens Levenhagen, Andreas Bortfeldt, Hermann Gehring:
Path Tracing in Genetic Algorithms Applied to the Multiconstrained Knapsack Problem. EvoWorkshops 2001: 40-49 - 2000
- [j1]Andreas Bortfeldt:
Eine Heuristik für Multiple Containerladeprobleme. OR Spectr. 22(2): 239-261 (2000)
1990 – 1999
- 1995
- [b1]Andreas Bortfeldt:
Informierte Graphensuchverfahren und genetische Algorithmen zur Lösung von Containerbeladeproblemen. Free University of Berlin, Germany, Köster 1995, ISBN 978-3-89574-098-5, pp. 1-272
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 23:03 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:
