Program for stream Discrete optimization, mixed integer programming (contributed)

HA-22: Decision support and applications
Stream: Discrete optimization, mixed integer programming (contributed)
Room: 2104B
Chair(s): Muhammad Asim Qureshi

• Mining candidate solutions to understand the results of an optimization-based decision support system
  Michael Morin, Rallou Thomopoulos, Irene Abi-Zeid, Maxime Léger, François Grondin, Martin Pleau
• CPLEX 12.7 helps you write better models
  Xavier Nodet, Daniel Junglas
• A hybrid meta-heuristic algorithm for cut-off grade optimization in open pit mining operations
  Muhammad Asim Qureshi, Mohammad Waqar Ali Asad

HB-22: Paths and sequences
Stream: Discrete optimization, mixed integer programming (contributed)
Room: 2104B
Chair(s): Rosa Medina

• Enumeration of all the longest paths between two nodes using a small-m method
  Hiroyuki Goto, Yoichi Shimakawa, Masashi Miyagawa
• Adding edges with short lengths between one node and every other node of the same depth in a complete K-ary tree
  Kiyoshi Sawada
• Murty's algorithm for semiassignment problem
  Rosa Medina, Enrico Malaguti, Sebastian Rodriguez

HD-22: Routing and reliability problems
Stream: Discrete optimization, mixed integer programming (contributed)
Room: 2104B
Chair(s): Yousef Maknoon, Tonguc Ünlüyurt

• Planning of feeding station installment for a full electric large capacity urban bus system
  Virginie Lurkin, Yousef Maknoon, Shadi Sharif Azadeh, Michel Bierlaire
• Formulation for the asymmetric traveling salesman problem using mixed integer programming
  Gabriel Solari Carbajal
• Branch-and-Benders-cut algorithm for the network repair crew scheduling and routing problem
  Alfredo Moreno, Pedro Munari, Douglas Alem
• Fault localization for series systems when tests are unreliable
  Tonguc Ünlüyurt, Zahed Shahmoradi

HE-22: Applications in telecommunications, energy and biology
Stream: Discrete optimization, mixed integer programming (contributed)
Room: 2104B
Chair(s): Agnès Plateau

• A mixed-integer linear programming model for biomass terminal operations
  Ioannis Dafnomilis, Dingena Schott, Mark Duinkerken, Gabriel Lodewijks
• MILP formulations and branch & cut for the min-up/min-down unit commitment problem
  Cécile Rottner, Pascale Bendotti, Pierre Fouilhoux
• An integer programming approach to stem cell culture problem
  Jongyoon Park, Kyungsik Lee
• Comparison of mixed integer programming fromulations for the minimum connected coverage problem
  Agnès Plateau, Sourour Elloumi