David Schindl

PhD in mathematics

david.schindl@unifr.ch
+41 26 300 8477
https://orcid.org/0000-0002-7009-5530

Graph theory, discrete optimization (applications in logistics, supply chain, vehicle routes, scheduling/timetabling, etc.), statistics.

Lecturer
Department of Informatics

PER 21 bu. C321
Bd de Pérolles 90
1700 Fribourg

PER 21, C321

+41 26 300 8477

Biography

I obtained my PhD in mathematics from EPFL in 2004. After a 3-year postdoc at the Group for Research in Decision Analysis (GERAD) in Montreal, I was hired in 2008 at the Haute Ecole de Gestion (HEG) in Geneva, my main employer, where I am currently a lecturer.

My areas of research are graph theory and combinatorial optimization, with applications in logistics, vehicle routing and scheduling. In particular, since 2012 I have been in charge of course and exam timetabling at the HEG.

My teaching areas are decision support and graph theory (UniFR), and statistics and mathematics applied to economics (HEG).

Research and publications

Publications

18 publications

Locally Checkable Problems Parameterized by Clique-Width
David Schindl, Narmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries, (2022) | Journal article

Locally Checkable Problems Parameterized by Clique-Width
David Schindl, Narmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries, (2022) | Journal article

Optimal student sectioning on mandatory courses with various sections numbers
Schindl, David, Annals of Operations Research (2019) | Journal article

On Split B-1-EPG Graphs
Deniz, Zakir, Schindl, David, Ries, Bernard, Nivelle, Simon, Lecture Notes in Computer Science (2018) | Journal article

Preface: Special Issue on the Ninth International Colloquium on Graphs and Optimization (GO IX), 2014
Varone, Sacha, Schindl, David, Milanic, Martin, Bertazzi, Luca, Archetti, Claudia, Discrete Applied Mathematics (2018) | Journal article

Learning Tabu Search for Combinatorial Optimization
Schindl, David, Zufferey, Nicolas, Communications in Computer and Information Science (2015) | Journal article

A Learning Tabu Search for a Truck Allocation Problem with Linear and Nonlinear Cost Components
Zufferey, Nicolas, Schindl, David, Naval Research Logistics (NRL) (2015) | Journal article

Solution Methods for Fuel Supply of Trains
Zufferey, Nicolas, Schindl, David, INFOR: Information Systems and Operational Research (2013) | Journal article

Heuristics for a project management problem with incompatibility and assignment costs
Schindl, David, Labarthe, Olivier, Zufferey, Nicolas, Computational Optimization and Applications (2012) | Journal article

Ant Local Search and its efficient adaptation to graph colouring
Schindl, D., Zufferey, N., Plumettaz, M., Journal of the Operational Research Society (2010) | Journal article

A solution method for a car fleet management problem with maintenance constraints
Hertz, Alain, Zufferey, Nicolas, Schindl, David, Journal of Heuristics (2009) | Journal article

Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
Schindl, D., Labbe, M., Hansen, P., Discrete Optimization (2009) | Journal article

Average Distance and Maximum Induced Forest
Schindl, David, Marcotte, Odile, Kilani, Rim, Hertz, Alain, Hansen, Pierre, Journal of Graph Theory (2009) | Journal article

Some simple optimization techniques for self-organized public key management in mobile ad hoc networks
de Werra, D, Schindl, D, Bornand-Jaccard, T, Discrete Applied Mathematics (2006) | Journal article

A solvable case of image reconstruction in discrete tomography
Schindl, D, Picouleau, C, de Werra, D, Costa, MC, Discrete Applied Mathematics (2005) | Journal article

Some new hereditary classes where graph coloring remains NP-hard
Schindl, D, Discrete Mathematics (2005) | Journal article

P-5-free augmenting graphs and the maximum stable set problem
Schindl, D, Hertz, A, Gerber, MU, Discrete Applied Mathematics (2003) | Journal article

Finding augmenting chains in extensions of claw-free graphs
Schindl, D, Lozin, V, Hertz, A, Information Processing Letters (2003) | Journal article

Research projects

Start	01.09.2019
End	31.08.2022
Funding	Innovation
In Swiss municipalities, a curbside system is often used to collect the non-recoverable solid waste. In principle, the trucks stop at every household for the collection. Due to the many stops of the heavy trucks, this classic strategy causes high fuel consumption, emissions and noise. The objective of this project is to improve the municipal solid waste collection process by designing efficient and sustainable waste collection strategies targeted to the needs of the municipalities. This objective is pursued through the following three components. First, new waste collection concepts are proposed using modern physical waste collection elements, such as electric vehicles and containers with compressors. For example, small, agile vehicles may bring the garbage bags to larger containers in intermediate depots and large vehicles may then regularly discharge these containers. Second, mathematical models and optimization algorithms are developed for deciding how to design a waste collection concept for a given municipality in the best possible way. Typical decisions are about the locations of the waste collection points, the types of vehicles used to collect the waste at all collection points and the routing of each vehicle. Third, an interactive decision support tool is developed. It enables to specify the inputs, such as the street network and the waste quantities, and to display the results of the optimization algorithms for all alternatives. This tool will help the decision-makers to choose the best waste collection concept for their municipality.

Teaching and courses

Show in course program