Program

Wednesday, October 26, morning: 9.00 - 12.30

• 9.00: opening session
   
• 9.30 - 10.30 (Wednesday): Plenary session - Chairman : H. Yanasse - Room Emeraude
  • C. Ribeiro, S. Urrutia: Applications of combinatorial optimization in sports scheduling and management
  
  
• 10.30 - 11.00: Coffee break - Room E200
   
• 11.00 - 12.30 (Wednesday): Parallel sessions
  Decision aid - Chairman : M.-C. Costa - Room Emeraude
  • 11.00: J. Hernández R., J. Burgos J., M. Garcia G., Y. Velásquez E.: Locating of emergency vehicles
  • 11.30: L. Koshlai, M. Mikhalevich: Multicriteria analysis for decision-making
  • 12.00: R. Bisdorff: On computing kernels in bipolar valued digraphs
  
  Timetables - Chairman : G. Nasini - Room B310
  • 11.00: D. Gravot, N. Guerinik, M. Hadjiar: Schedule employee timetables under constraints in retail organizations: a generic approach
  • 11.30: B. Detienne, L. Peridy, E. Pinson, D. Rivreau: Cut generation approaches for solving employee timetabling problems
  • 12.00: C. Soza, R. Landa, M. C. Riff: Towards a cultural algorithm to solve timetabling problems
  
  Bio-informatics - Chairman : A. Guénoche - Room B312
  • 11.00: L. Denœud, I. Charon, A. Guénoche, O. Hudry: Overlapping clustering in a graph and application to protein interactions
  • 11.30: B. Kaba: Grouping genes using decompositions of graph families
  • 12.00: C. Sinoquet: A metaheuristics approach dedicated to structured motif discovery in DNA sequences

12.30 - 14.00: Lunch

Wednesday, October 26, afternoon: 14.00 - 18.30

• 14.00 - 16.00 (Wednesday): Parallel sessions
  Lot sizing - Chairman : F. Sourd - Room Emeraude
  • 14.00: N. Absi, S. Kedad-Sidhoum: Capacitated lot-sizing problem with setup times stock and demand shortages
  • 14.30: J. Briton: Methods for solving a batch sizing problem under finite capacity
  • 15.00: O. Liess, P. Michelon: Cut generation for the lotsizing and scheduling problem
  • 15.30: D. Romero Morales, R. B. Lok, R. Steinberg : Combinatorial auctions for the procurement of a product over a planning horizon
  
  Integer programming - Chairman : S. Martins - Room B310
  • 14.00: S. Kameshwaran, L. Benyoucef: Multiunit discount auctions
  • 14.30: M. Landete, A. Marín: A new model for the uncapacitated multiple allocation p-hub location problem
  • 15.00: T. Belgacem, M. Hifi: Sensitivity analysis for the knapsack sharing problem
  • 15.30: D. O. Fernandez Pons: Models for a variable-sized packing problem
  
  Graphs 1 - Chairman : D. Brito - Room B312
  • 14.00: P.O. Boaventura-Netto: P-antiregular graphs
  • 14.30: B. Alspach, D. Dyer, D. Hanson, B. Yang: Sweeping digraphs
  • 15.00: V. Jost, B. Lévêque, F. Maffray: Precoloring co-Meyniel graphs
  • 15.30: A. Vietri: Graceful labellings of generalised Petersen graphs
  
  
• 16.00 - 16.30: Coffee break - Room E200
   
• 16.30 - 18.30 (Wednesday): Parallel sessions
  Assigment - Chairman : M. Landete - Room Emeraude
  • 16.30: A. C. Linhares, D. Feillet, P. Michelon: A strategy based on site availability for dynamic frequency assignment problem
  • 17.00: M. S. Sabbagh, J. E. Falk: Theory and application of optimality conditions for the linear assignment problem
  • 17.30: A. Idrissi, C. Min Li: An optimization model using constraints network for capacity allocation problem
  • 18.00: R. M. V. Figueiredo, V. C. Barbosa, N. Maculan, C. C. de Souza: On the polytope of acyclic orientations with path constraints ant its applications
  
  Vehicle routing problems - Chairman : C. Oliva - Room B310
  • 16.30: M. Cepeda, C. Oliva, L. Fuentes : Vehicular routing problem with time windows and scheduling of departure VRPTWSD: an application with ant colony system
  • 17.00: M. T. Godinho, L. Gouveia, T.L L. Magnanti: On hop-indexed reformulations for the unit demand vehicle routing problem
  • 17.30: A. Løkketangen, D. L. Woodruff: Measures for difference and similarity between VRP solutions
  • 18.00: E. Soedarmadji, R. J. McEliece: The gas station problem
  
  Graphs 2 - Chairman : A. Lobstein - Room B312
  • 16.30: D. Brito, G. Lárez: Neighborhood conditions for a balanced bipartite graph to be K ordered Hamiltonian
  • 17.00: T. Laihonen: Codes for robust identification
  • 17.30: B. Randerath, A. Wagler: The normal graph conjecture for sparse graphs

19.00 - 20.00 (Wednesday) Welcoming cocktail - Room E200

Thursday, October 27, morning: 9.00 - 12.30

• 9.00 - 10.30 (Thursday): Parallel sessions
  Ordering problems - Chairman : J.-P. Barthélemy - Room Emeraude
  • 9.00: I. Méndez-Díaz, G. Nasini : The disjunctive rank as strength measure of valid inequalities
  • 9.30: F. Marval: Computational results solving the simplest assembly line balancing problem with an integer linear programming model
  • 10.00: A. B. Queiroz, J. L. Szwarcfiter : generating interval and semi-order extensions of an order
  
  Local and global search - Chairman : F. Baesler - Room B310
  • 9.00: N. Bouhmala: A new and efficient iterative local search method for binary constraint satisfactions problems
  • 9.30: C. Canon, J.-C. Billaut, J.-L. Bouquard: Local search for solving the shift design problem
  • 10.00: R. Z. Ríos, M. Laguna : An improved scatter search approach for makespan minimization in a flow-shop with sequence-dependent setup times
  
  Networks - Chairman :A. Candia - Room B312
  • 9.00: E. Amaldi, S. Bosio, F. Malucelli, D. Yuan: Set covering with overlaps: models and algorithms for the WLAN design problem
  • 9.30: S. Varone, N. Zufferey: MI-FAP applied to 802.11 networks: a graph coloring approach
  • 10.00: C. Bentz, M.-C. Costa, C. Picouleau, M. Zrikem: The shortest multipaths problem in a capacitated dense channel
  
  
• 10.30 - 11.00: Coffee break - E200
   
• 11.00 - 12.30 (Thursday): Parallel sessions
  Multicriteria and multiobjective - Chairman : X. Gandibleux - Room Emeraude
  • 11.00: E. Mokotoff, J. C. Ochoa, A. I. Gutierrez: A discrete multicriterion decision model for hybrid flowshop problems
  • 11.30: A. Przybylski, X. Gandibleux, M. Ehrgott: A recursive algorithm for finding all extremal supported non-dominated points in the outcome set of a multiobjective integer linear problem
  • 12.00: C. R. Pedersen, L. R. Nielsen, K. A. Andersen: The bicriteria multi modal assignment problem
  
  Algorithms - Chairman : J. Telhada - Room B310
  • 11.00: H. A. Harutyunyan, Y. Zhang: Tree-based algorithm for network spare capacity design
  • 11.30: E. Amaldi, M. Bruglieri, G. Casale: A two-phase relaxation-based algorithm for the maximum feasible subsystem problem
  • 12.00: I. Abi-Zeid, O. Nilo, L. Lamontagne: Constraint programming for aeronautical search resources allocation
  
  Clustering - Chairman : R. Bisdorff - Room B312
  • 11.00: J.-P. Barthélemy, F. Brucker: Subdominant theory: a tour guide
  • 11.30: H. Akeb, Y. Li: Improvement of an equal circle packing heuristic by investigating initial configuration
  • 12.00: J. Gordillo, E. Conde: Detecting spam mail via a hidden Markov model

12.30 - 14.00: Lunch

Thursday, October 27, afternoon: 14.00 - 16.30

• 14.00 - 15.00 (Thursday): Plenary session - Chairman : P. Tolla - Room Emeraude
  • A. Tsoukiàs: OR and EURO: past achievements and future challenges
  
  
• 15.00 - 15.30: Coffee break - E200
   
• 15.30 - 16.30 (Thursday): Parallel sessions
  Metaheuristics - Chairman : M. Vasquez - Room Emeraude
  • 15.30: X. Bonnaire: A self organized and high available peer-to-peer architecture for cooperation between exact and heuristic techniques
  • 16.00: F. Baesler, R. Moraga, O. Cornejo: The use of memory elements in simulated annealing to solve multiObjective parallel machine scheduling problems
  
  Quadratic programming - Chairman : A. Lokketangen - Room B310
  • 15.30: A. Billionnet, S. Elloumi, M.-C. Plateau: Convex quadratic reformulation applied to the graph equicut problem
  • 16.00: S. Quadri, E. Soutif, P. Tolla: Comparison of different branch-and-bound methods for a quadratic separable multi-knapsack problem
  
  Trees - Chairman : I. Méndez-Díaz - Room B312
  • 15.30: A. Candia, E. Conde: Minmax regret spanning arborescences under uncertain costs
  • 16.00: L. Gouveia, J. Telhada: Reformulating the multi weighted Steiner tree problem by intersection
  
  

Friday, October 28, morning: 9.00 - 12.30

• 9.00 - 10.00 (Friday): Plenary session- Chairman : O. Hudry - Room Emeraude
  • S. Oussedik: Advances in modeling and solving mathematical programming problems
  
  
• 10.00 - 10.30: Coffee break - Room E200
   
• 10.30 - 12.30 (Friday): Parallel sessions
  Dynamic programming - Chairman : O. Rioul - Room Emeraude
  • 10.30: A. Le Poupon, O. Rioul: An optimal algorithm for resource allocation with concave cost fonctions
  • 11.00: M. Oswald, G. Reinelt: The simultaneous consecutive ones problem
  • 11.30: F. Malucelli, S. Pallottino, D. Pretolani: The stack loading and unloading problem
  • 12.00: M. Hifi, T. Saadi: Unsing strip generation procedures for solving constrained two-staged cutting problems
  
  Polyhedral methods - Chairman : W. Ben Ameur - Room B310
  • 10.30: A. Marín, S. Nickel, J. Puerto, S. Velten: New formulation and solution method for a flexible discrete location model
  • 11.00: A. Koster, A. Wagler: Comparing imperfection ration and imperfection index
  • 11.30: S. Coulonges, A. Pêcher, A. K. Wagler: On stable set polytopes of circular-perfect graphs
  • 12.00: W. Ben-Ameur, J. Neto: Some improvements for constraints generation algorithm
  
  Partitioning - Chairman : F. Brucker - Room B312
  • 10.30: A. Guénoche: Comparison of algorithms in graph partitioning
  • 11.00: F. Jaehn, U. Dorndorf, E. Pesch: Modelling flight gate scheduling as a clique partitioning problem
  • 11.30: P. Chrétienne, N. Faure, É. Gourdin, F. Sourd: Multicast sessions partitioning problems
  • 12.00: J. Monnot, S. Toulouse: The weighted Pk packing problem in bipartite graphs

12.30 - 14.00: Lunch

Friday, October 28, afternoon: 14.00 - 18.30

• 14.00 - 16.00 (Friday): Parallel sessions
  Coloration problems - Chairman : D. Pretolani - Room Emeraude
  • 14.00: M. Campêlo, V. Campos, R. Corrêa, C. Rodrigues: On fractional and integer chromatic numbers of a graph via cutting and pricing
  • 14.30: M. Demange, T. Ekim, D. de Werra: Variations of split-coloring in permutation graphs
  • 15.00: M. Vasquez: Further results on the queen graph coloring problem
  
  Relaxation - Chairman : G. Plateau - Room B310
  • 14.00: H. H. Yanasse, M. J. Pinto: A lagrangean approach to solve a cutting stock problem under a particular pattern sequencing constraints
  • 14.30: W. Ben-Ameur, J. Neto: Relax and keep the same set of optimal solutions
  • 15.00: J. F. Lockiby A., M. V. Centeno R.: Relaxation for the 3AP-planar
  • 15.30: Y. A. Rios, F. Sourd: Parallel scheduling problem with irregular cost functions
  
  Scheduling - Chairman : P. Michelon - Room B312
  • 14.00: M. Cepeda, R. Vera: Priority rules for scheduling: a simulation-optimization approach
  • 14.30: V. Giakoumakis, C. B. Ould El Mounir: Scheduling optimization problems for two new classes of vertex series-parallel graphs
  • 15.00: J. Pelikán: Scheduling serial - parallel processors - a case study
  • 15.30: F. Sourd: Preemptive scheduling around a common due date
  
  
• 16.00 - 16.30: Coffee break - Room E200
   
• 16.30 - 18.30 (Friday): Parallel sessions
  Statistics - Chairman : R. Rios - Room Emeraude
  • 16.30: M. E. Camargo, H. R. Friedrich, W. P. Filho, S. L. Russo, A. I. dos Santos: Statistical process control in a manufacture of agricultural tractors
  • 17.00: S. Russo, P. M. M. Rodrigues: Alternative methodology to technical control charts
  • 17.30: B. Brandl, Ch. Keber, M.G. Schuster: Combinatorial variable selection for regression forecast models: a genetic algorithm approach
  • 18.00: S. Russo, J. P. Fabris, M. E. Camargo: Poisson regression models and control chart for discrete variables
  
  Branching methods - Chairman : E. Soutif - Room B310
  • 16.30: C. Alves, J. Valério de Carvalho: A new branch and price and cut algorithm for the Pattern Minimization Problem
  • 17.00: I. Méndez-Díaz, P. Zabala, A. Lucena : A branch and cut algorithm for the deliveryman problem
  • 17.30: C. Lavor, L. Liberti, N. Maculan: A branch and prune algorithm for molecular conformation problems
  
  Graph algorithms - Chairman : C. Ribeiro - Room B312
  • 16.30: J. W. C. Pinto, S. L. Martins, I. Rossetti, C. C. Ribeiro: Heuristics for demand routing with a bounded number of paths
  • 17.00: S. Achouri, T. Bossart, A. Munier-Kordon: A polynomial algorithm for minDSC on series parallel digraphs
  • 17.30: M. Pascoal, M. Eugénia Captivo, J. Clímaco: A lazy version of a K quickest simple path ranking algorithm

19.00 - 20.00 (Friday): Closing buffet dinner - Room E200