Verena Schmid

Orcid: 0000-0003-4416-2725

According to our database1, Verena Schmid authored at least 23 papers between 2009 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Dynamic assignment of a multi-skilled workforce in job shops: An approximate dynamic programming approach.
Eur. J. Oper. Res., 2023

2022
Solving an Open Legal Data Puzzle With an Interdisciplinary Team.
IEEE Softw., 2022

MISm: A Medical Image Segmentation Metric for Evaluation of weak labeled Data.
CoRR, 2022

2017
An Effective Large Neighborhood Search for the Team Orienteering Problem with Time Windows.
Proceedings of the Computational Logistics - 8th International Conference, 2017

2016
A large neighbourhood based heuristic for two-echelon routing problems.
Comput. Oper. Res., 2016

Variable neighborhood search for the stochastic and dynamic vehicle routing problem.
Ann. Oper. Res., 2016

2015
Integrated timetabling and vehicle scheduling with balanced departure times.
OR Spectr., 2015

A fast large neighbourhood based heuristic for the Two-Echelon Vehicle Routing Problem.
CoRR, 2015

2014
Examination and Operating Room Scheduling Including Optimization of Intrahospital Routing.
Transp. Sci., 2014

Hybrid large neighborhood search for the bus rapid transit route design problem.
Eur. J. Oper. Res., 2014

2013
Rich routing problems arising in supply chain management.
Eur. J. Oper. Res., 2013

Hybrid column generation and large neighborhood search for the dial-a-ride problem.
Comput. Oper. Res., 2013

Metaheuristics for order batching and sequencing in manual order picking systems.
Comput. Ind. Eng., 2013

Solving the 2D Bin Packing Problem by Means of a Hybrid Evolutionary Algorithm.
Proceedings of the International Conference on Computational Science, 2013

2012
Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming.
Eur. J. Oper. Res., 2012

On Solving the Oriented Two-Dimensional Bin Packing Problem under Free Guillotine Cutting: Exploiting the Power of Probabilistic Solution Construction.
CoRR, 2012

Variable neighbourhood search for the variable sized bin packing problem.
Comput. Oper. Res., 2012

2011
Solving the Two-Dimensional Bin Packing Problem with a Probabilistic Multi-start Heuristic.
Proceedings of the Learning and Intelligent Optimization - 5th International Conference, 2011

2010
Ambulance location and relocation problems with time-dependent travel times.
Eur. J. Oper. Res., 2010

Hybridization of very large neighborhood search for ready-mixed concrete delivery problems.
Comput. Oper. Res., 2010

Survey: Matheuristics for Rich Vehicle Routing Problems.
Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010

Hybrid Algorithms for the Variable Sized Bin Packing Problem.
Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010

2009
A Hybrid Solution Approach for Ready-Mixed Concrete Delivery.
Transp. Sci., 2009


  Loading...