default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJakob Puchinger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Hongping Wang
, Adam F. Abdin, Yi-Ping Fang, Jakob Puchinger, Enrico Zio:
Coordinating dynamic traffic-power systems under decentralized and centralized decision environments. Comput. Ind. Eng. 196: 110474 (2024)- [j20]Belma Turan, Vera C. Hemmelmayr, Allan Larsen, Jakob Puchinger:
Transition towards sustainable mobility: the role of transport optimization. Central Eur. J. Oper. Res. 32(2): 435-456 (2024) - [j19]Jinming Liu, Adam F. Abdin, Jakob Puchinger:
Improving critical buildings energy resilience via shared autonomous electric vehicles - A sequential optimization framework. Comput. Oper. Res. 163: 106513 (2024) - [j18]Shaohua Yu, Jakob Puchinger, Shudong Sun:
Electric van-based robot deliveries with en-route charging. Eur. J. Oper. Res. 317(3): 806-826 (2024) - 2023
- [j17]Yue Su, Nicolas Dupin, Jakob Puchinger:
A deterministic annealing local search for the electric autonomous dial-a-ride problem. Eur. J. Oper. Res. 309(3): 1091-1111 (2023) - [j16]Abdelhadi Belfadel, Sebastian Hörl, Rodrigo Javier Tapia, Dimitra Politaki, Ibad Kureshi, Lorant A. Tavasszy, Jakob Puchinger:
A conceptual digital twin framework for city logistics. Comput. Environ. Urban Syst. 103: 101989 (2023) - [c16]Tarek Chouaki, Sebastian Hörl, Jakob Puchinger:
Control-based integration of rejection rates into endogenous demand ride-pooling simulations. MT-ITS 2023: 1-6 - 2022
- [j15]Shaohua Yu, Jakob Puchinger, Shudong Sun:
Van-based robot hybrid pickup and delivery routing problem. Eur. J. Oper. Res. 298(3): 894-914 (2022) - [j14]Ulrike Ritzinger, Jakob Puchinger, Christian Rudloff, Richard F. Hartl:
Comparison of anticipatory algorithms for a dial-a-ride problem. Eur. J. Oper. Res. 301(2): 591-608 (2022) - [j13]Miriam Enzi, Sophie N. Parragh, Jakob Puchinger:
The bi-objective multimodal car-sharing problem. OR Spectr. 44(2): 307-348 (2022) - [c15]Tarek Chouaki, Sebastian Hörl, Jakob Puchinger:
Implementing reinforcement learning for on-demand vehicle rebalancing in MATSim. ANT/EDI40 2022: 134-141 - [c14]Ayman Mahmoud, Tarek Chouaki, Sebastian Hörl, Jakob Puchinger:
Extending JSprit to solve electric vehicle routing problems with recharging. ANT/EDI40 2022: 289-295 - 2021
- [j12]Abood Mourad, Jakob Puchinger, Tom Van Woensel:
Integrating autonomous delivery service into a passenger transportation system. Int. J. Prod. Res. 59(7): 2116-2139 (2021) - 2020
- [i5]Miriam Enzi, Sophie N. Parragh, Jakob Puchinger:
The bi-objective multimodal car-sharing problem. CoRR abs/2010.10344 (2020)
2010 – 2019
- 2019
- [j11]Gerhard Hiermann, Richard F. Hartl, Jakob Puchinger, Thibaut Vidal:
Routing a mix of conventional, plug-in hybrid, and electric vehicles. Eur. J. Oper. Res. 272(1): 235-248 (2019) - [j10]Tolga Bektas, Jan Fabian Ehmke, Harilaos N. Psaraftis, Jakob Puchinger:
The role of operational research in green freight transportation. Eur. J. Oper. Res. 274(3): 807-823 (2019) - [i4]Reza Vosooghi, Jakob Puchinger, Joschka Bischoff, Marija Jankovic, Anthony Vouillon:
Shared Autonomous Electric Vehicle Service Performance: Assessing the Impact of Charging Infrastructure and Battery Capacity. CoRR abs/1905.12160 (2019) - [i3]Reza Vosooghi, Joseph Kamel, Jakob Puchinger, Vincent Leblond, Marija Jankovic:
Robo-Taxi service fleet sizing: assessing the impact of user trust and willingness-to-use. CoRR abs/1905.12267 (2019) - [i2]Reza Vosooghi, Jakob Puchinger, Marija Jankovic, Anthony Vouillon:
Shared Autonomous Vehicle Simulation and Service Design. CoRR abs/1906.07588 (2019) - 2017
- [j9]Karl F. Doerner, Richard W. Eglese, Richard F. Hartl, Jakob Puchinger:
Preface: Special issue on the VeRoLog 2015 conference. Networks 69(3): 239-240 (2017) - [c13]Reza Vosooghi, Jakob Puchinger, Marija Jankovic, Goknur Sirin:
A critical analysis of travel demand estimation for new one-way carsharing systems. ITSC 2017: 199-205 - 2016
- [j8]Ulrike Ritzinger, Jakob Puchinger, Richard F. Hartl:
Dynamic programming based metaheuristics for the dial-a-ride problem. Ann. Oper. Res. 236(2): 341-358 (2016) - [j7]Gerhard Hiermann, Jakob Puchinger, Stefan Ropke, Richard F. Hartl:
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations. Eur. J. Oper. Res. 252(3): 995-1018 (2016) - 2015
- [j6]Gerhard Hiermann, Matthias Prandtstetter, Andrea Rendl, Jakob Puchinger, Günther R. Raidl:
Metaheuristics for solving a multimodal home-healthcare scheduling problem. Central Eur. J. Oper. Res. 23(1): 89-113 (2015) - 2013
- [c12]Matthias Prandtstetter, Markus Straub, Jakob Puchinger:
On the way to a multi-modal energy-efficient route. IECON 2013: 4779-4784 - [p4]Ulrike Ritzinger, Jakob Puchinger:
Hybrid Metaheuristics for Dynamic and Stochastic Vehicle Routing. Hybrid Metaheuristics 2013: 77-95 - 2012
- [c11]Andrea Rendl, Matthias Prandtstetter, Gerhard Hiermann, Jakob Puchinger, Günther R. Raidl:
Hybrid Heuristics for Multimodal Homecare Scheduling. CPAIOR 2012: 339-355 - 2011
- [j5]Christian Blum, Jakob Puchinger, Günther R. Raidl, Andrea Roli:
Hybrid metaheuristics in combinatorial optimization: A survey. Appl. Soft Comput. 11(6): 4135-4151 (2011) - [j4]Jakob Puchinger, Peter J. Stuckey, Mark G. Wallace, Sebastian Brand:
Dantzig-Wolfe decomposition and branch-and-price solving in G12. Constraints An Int. J. 16(1): 77-99 (2011) - [c10]Christina N. Burt, Jakob Puchinger:
Models and Algorithms for Intermodal Transportation and Equipment Selection. OR 2011: 305-310 - 2010
- [j3]Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy:
The Multidimensional Knapsack Problem: Structure and Algorithms. INFORMS J. Comput. 22(2): 250-265 (2010) - [p3]Jakob Puchinger, Günther R. Raidl, Sandro Pirkwieser:
MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics. Matheuristics 2010: 71-102
2000 – 2009
- 2009
- [i1]Jakob Puchinger, Peter J. Stuckey, Mark Wallace, Sebastian Brand:
Branch-and-Price Solving in G12. Models and Algorithms for Optimization in Logistics 2009 - 2008
- [j2]Jakob Puchinger, Günther R. Raidl:
Bringing order into the neighborhoods: relaxation guided variable neighborhood search. J. Heuristics 14(5): 457-472 (2008) - [c9]Samuel J. Huston, Jakob Puchinger, Peter J. Stuckey:
The Core Concept for 0/1 Integer Programming. CATS 2008: 39-47 - [c8]Jakob Puchinger, Peter J. Stuckey, Mark Wallace, Sebastian Brand:
From High-Level Model to Branch-and-Price Solution in G12. CPAIOR 2008: 218-232 - [c7]Sebastian Brand, Gregory J. Duck, Jakob Puchinger, Peter J. Stuckey:
Flexible, Rule-Based Constraint Model Linearisation. PADL 2008: 68-83 - [c6]Jakob Puchinger, Peter J. Stuckey:
Automating branch-and-bound for dynamic programs. PEPM 2008: 81-89 - [p2]Günther R. Raidl, Jakob Puchinger:
Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization. Hybrid Metaheuristics 2008: 31-62 - [p1]Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger:
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 69-85 - 2007
- [j1]Jakob Puchinger, Günther R. Raidl:
Models and algorithms for three-stage two-dimensional bin packing. Eur. J. Oper. Res. 183(3): 1304-1327 (2007) - [c5]Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger:
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem. EvoCOP 2007: 176-187 - 2006
- [c4]Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy:
The Core Concept for the Multidimensional Knapsack Problem. EvoCOP 2006: 195-208 - 2005
- [c3]Jakob Puchinger, Günther R. Raidl:
Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification. IWINAC (2) 2005: 41-53 - 2004
- [c2]Jakob Puchinger, Günther R. Raidl, Gabriele Koller:
Solving a Real-World Glass Cutting Problem. EvoCOP 2004: 165-176 - [c1]Jakob Puchinger, Günther R. Raidl:
An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing. PPSN 2004: 642-651
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-12-10 20:49 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:
