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
  30 publications

  2025 2024 2022 2020 2019 2018 2016 2015 2014 2013 2012 2010 2009 2006 2005 2003

  Extremal Chemical Graphs for the Arithmetic-Geometric Index
  Match Communications in Mathematical and in Computer Chemistry (2025) | Journal article

  Finding k-community structures in special graph classes
  David Schindl, Narmina Baghirova, Clément Dallard, Bernard Ries, Discrete Applied Mathematics (2024) | Journal article

  A Benders Decomposition Approach for a Capacitated Multi-vehicle Covering Tour Problem with Intermediate Facilities
  Antoine Legrain, Vera Fischer, David Schindl (2024) | Book chapter

  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

  Finding k-community structures in special graph classes
  Baghirova, N. and Dallard, C. and Ries, B. and Schindl, D. , arXiv (2022) | Other

  On Some Subclasses of Split B1-EPG Graphs
  Deniz, Zakir; Nivelle, Simon; Ries, Bernard; Schindl, David (Cham : Springer, 2020: LATIN 2020: theoretical informatics, 2020) | Book

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

  On Split B-1-EPG Graphs
  Schindl, David, Ries, Bernard, Nivelle, Simon, Deniz, Zakir, 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

  Student sectioning for minimizing potential conflicts on multi-section courses
  Schindl, D., PATAT 2016 - Proceedings of the 11th International Conference on the Practice and Theory of Automated Timetabling: (2016) | Conference

  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

  On the maximum orders of an induced forest, an induced tree, and a stable set
  Hertz, A. and Marcotte, O. and Schindl, D., Yugoslav Journal of Operations Research (2014) | Journal article

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

  Course opening, assignment and timetabling with student preferences
  Varone, S. and Schindl, D., ICORES 2013 - Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems: (2013) | Conference

  A learning tabu search and graph models for a location-distribution problem in a railway network
  Schindl, David and Zufferey, Nicolas (Genève: HEC, 2013) | Book

  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 for refueling locomotives
  Schindl, David and Zufferey, Nicolas (Genève: HEC, 2012) | Book

  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

  A solution method for a car fleet management problem with maintenance constraints
  Hertz, Alain; Schindl, David; Zufferey, Nicolas (Norwell, Mass. [u.a.] : Springer Science + Business Media, 1995: Journal of heuristics, 2009) | Book

  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

  Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints
  Hertz, A. and Schindl, D. and Zufferey, N., 4OR (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

  Efficient and sustainable waste collection
  Status: Completed

  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