Virginie Gabrel

An improved DSATUR-based Branch and Bound for the Vertex Coloring Problem

  • Fabio Furini
  • Virginie Gabrel
  • Ternier Ian-Christopher
    • Categories Integer Programming, Network Optimization Tags , ,

    Given an undirected graph, the Vertex Coloring Problem (VCP) consists of assigning a color to each vertex of the graph in such a way that two adjacent vertices do not share the same color and the total number of colors is minimized. DSATUR based Branch and Bound (DSATUR) is an effective exact algorithm for the … Read more

    Recent Advances in Robust Optimization and Robustness: An Overview

  • Virginie Gabrel
  • Aurelie Thiele
  • Cecile Murat
    • Categories Robust Optimization Tags

    This paper provides an overview of developments in robust optimization and robustness published in the academic literature over the past five years. Citation Technical report, LAMSADE, Universite Paris-Dauphine, Paris, France. (2012) Article Download View Recent Advances in Robust Optimization and Robustness: An Overview