Jérémy Omer

Combinatorial Robust Optimization with Decision-Dependent Information Discovery and Polyhedral Uncertainty

  • Jérémy Omer
  • Michael Poss
    • Categories Combinatorial Optimization, Robust Optimization Tags , , ,

    Given a nominal combinatorial optimization problem, we consider a robust two-stages variant with polyhedral cost uncertainty, called Decision-Dependent Information Discovery (DDID). In the first stage, DDID selects a subset of uncertain cost coefficients to be observed, and in the second-stage, DDID selects a solution to the nominal problem, where the remaining cost coefficients are still … Read more

    Vertex ordering with optimal number of adjacent predecessors

  • Tangi Migot
  • Jérémy Omer
    • Categories Combinatorial Optimization Tags , , ,

    In this paper, we study the complexity of the selection of a graph discretization order with a stepwise linear cost function.Finding such vertex ordering has been proved to be an essential step to solve discretizable distance geometry problems (DDGPs). DDGPs constitute a class of graph realization problems where the vertices can be ordered in such … Read more

    A polynomial algorithm for minimizing travel time in time-dependent networks with waits

  • Jérémy Omer
  • Michael Poss
    • Categories Network Optimization

    We consider a time-dependent shortest path problem with possible waiting at each node and a global bound $W$ on the total waiting time. The goal is to minimize only the time travelled along the edges of the path, not including the waiting time. We prove that the problem can be solved in polynomial time when … Read more