default search action
Verena Schmid
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j15]Luis Mauricio Annear
, Raha Akhavan-Tabatabaei, Verena Schmid:
Dynamic assignment of a multi-skilled workforce in job shops: An approximate dynamic programming approach. Eur. J. Oper. Res. 306(3): 1109-1125 (2023) - 2022
- [j14]Lörinc Thurnay
Solving an Open Legal Data Puzzle With an Interdisciplinary Team. IEEE Softw. 39(1): 55-60 (2022) - [i3]Dennis Hartmann
MISm: A Medical Image Segmentation Metric for Evaluation of weak labeled Data. CoRR abs/2210.13642 (2022)
2010 – 2019
- 2017
- [c5]Verena Schmid, Jan Fabian Ehmke
An Effective Large Neighborhood Search for the Team Orienteering Problem with Time Windows. ICCL 2017: 3-18 - 2016
- [j13]Briseida Sarasola
Variable neighborhood search for the stochastic and dynamic vehicle routing problem. Ann. Oper. Res. 236(2): 425-461 (2016) - [j12]Ulrich Breunig
A large neighbourhood based heuristic for two-echelon routing problems. Comput. Oper. Res. 76: 208-225 (2016) - 2015
- [j11]Verena Schmid, Jan Fabian Ehmke
Integrated timetabling and vehicle scheduling with balanced departure times. OR Spectr. 37(4): 903-928 (2015) - [i2]Ulrich Breunig, Verena Schmid, Richard F. Hartl, Thibaut Vidal:
A fast large neighbourhood based heuristic for the Two-Echelon Vehicle Routing Problem. CoRR abs/1505.08003 (2015) - 2014
- [j10]Verena Schmid:
Hybrid large neighborhood search for the bus rapid transit route design problem. Eur. J. Oper. Res. 238(2): 427-437 (2014) - [j9]Verena Schmid, Karl F. Doerner
Examination and Operating Room Scheduling Including Optimization of Intrahospital Routing. Transp. Sci. 48(1): 59-77 (2014) - 2013
- [j8]Sebastian Henn, Verena Schmid:
Metaheuristics for order batching and sequencing in manual order picking systems. Comput. Ind. Eng. 66(2): 338-351 (2013) - [j7]Sophie N. Parragh
Hybrid column generation and large neighborhood search for the dial-a-ride problem. Comput. Oper. Res. 40(1): 490-497 (2013) - [j6]Verena Schmid, Karl F. Doerner
Rich routing problems arising in supply chain management. Eur. J. Oper. Res. 224(3): 435-448 (2013) - [c4]Christian Blum
Solving the 2D Bin Packing Problem by Means of a Hybrid Evolutionary Algorithm. ICCS 2013: 899-908 - 2012
- [j5]Vera C. Hemmelmayr
Variable neighbourhood search for the variable sized bin packing problem. Comput. Oper. Res. 39(5): 1097-1108 (2012) - [j4]Verena Schmid:
Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming. Eur. J. Oper. Res. 219(3): 611-621 (2012) - [i1]Christian Blum, Verena Schmid, Lukas Baumgartner:
On Solving the Oriented Two-Dimensional Bin Packing Problem under Free Guillotine Cutting: Exploiting the Power of Probabilistic Solution Construction. CoRR abs/1209.0880 (2012) - 2011
- [c3]Lukas Baumgartner, Verena Schmid, Christian Blum
Solving the Two-Dimensional Bin Packing Problem with a Probabilistic Multi-start Heuristic. LION 2011: 76-90 - 2010
- [j3]Verena Schmid, Karl F. Doerner
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems. Comput. Oper. Res. 37(3): 559-574 (2010) - [j2]Verena Schmid, Karl F. Doerner
Ambulance location and relocation problems with time-dependent travel times. Eur. J. Oper. Res. 207(3): 1293-1303 (2010) - [c2]Christian Blum
Hybrid Algorithms for the Variable Sized Bin Packing Problem. Hybrid Metaheuristics 2010: 16-30 - [c1]Karl F. Doerner, Verena Schmid:
Survey: Matheuristics for Rich Vehicle Routing Problems. Hybrid Metaheuristics 2010: 206-221
2000 – 2009
- 2009
- [j1]Verena Schmid, Karl F. Doerner
A Hybrid Solution Approach for Ready-Mixed Concrete Delivery. Transp. Sci. 43(1): 70-85 (2009)
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:59 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: