Eva Ley

Solution methods for partial inverse combinatorial optimization problems in which weights can only be increased

  • Eva Ley
  • Maximilian Merkert
    • Categories (Mixed) Integer Linear Programming, Branch and Cut Algorithms, Game Theory Tags , , ,

    Partial inverse combinatorial optimization problems are bilevel optimization problems in which the leader aims to incentivize the follower to include a given set of elements in the solution of their combinatorial problem. If the set of required elements defines a complete follower solution, the inverse combinatorial problem is solvable in polynomial time as soon as … Read more

    Robust Optimization Under Controllable Uncertainty

  • Eva Ley
  • Rebecca Marx
  • Maximilian Merkert
  • Tim Niemann
  • Sebastian Stiller
    • Categories Combinatorial Optimization, Robust Optimization Tags , , , , , ,

    Applications for optimization with uncertain data in practice often feature a possibility to reduce the uncertainty at a given query cost, e.g., by conducting measurements, surveys, or paying a third party in advance to limit the deviations. To model this type of applications we introduce the concept of optimization problems under controllable uncertainty (OCU). For … Read more