Michael Schneider

Industrial and Manufacturing Engineering · European Journal of Operational Research · 2014–2015

A researcher in the Science corpus: 4 papers; trusts 54 researchers and is trusted by 10 researchers here, as inferred from the citation graph.

Subfields

Whom Michael Schneider trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Jean-François Cordeau
  2. Olli Bräysy
  3. Stefan Røpke
  4. Paolo Toth
  5. Vera C. Hemmelmayr
  6. Gilbert Laporte
  7. Fred W. Glover
  8. Brian Davis
  9. Roberto Baldacci
  10. David Pisinger

Who trusts Michael Schneider overall

  1. Gerhard Hiermann
  2. Guy Desaulniers
  3. Dominik Goeke
  4. Jakob Puchinger
  5. Fausto Errico
  6. Stefan Røpke
  7. Stefan Irnich
  8. Maximilian Schiffer
  9. Richard F. Hartl

Papers from Michael Schneider's perspective

Ordered by how strongly the researchers Michael Schneider trusts endorse each paper. Same corpus, a different order for every researcher.

  1. The Granular Tabu Search and Its Application to the Vehicle-Routing Problem (INFORMS journal on computing)
  2. Optimization by Simulated Annealing
  3. A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows (INFORMS journal on computing)
  4. A unified heuristic for a large class of Vehicle Routing Problems with Backhauls (European Journal of Operational Research)
  5. Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking (4OR)
  6. Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms (Transportation Science)
  7. Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem (Mathematical programming)
  8. Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints (Discrete Optimization)
  9. A guide to vehicle routing heuristics (Journal of the Operational Research Society)
  10. Branch-and-Price: Column Generation for Solving Huge Integer Programs

Their papers