Lagrangean decomposition for integer nonlinear programming with linear constraints. - Philippe Michelon; Nelson Maculan (Math. Program., 1991)

Unconstrained 0-1 nonlinear programming: A nondifferentiable approach. - Philippe Michelon (J. Glob. Optim., 1992)

Lagrangean Methods for 0-1 Quadratic Problems. - Philippe Michelon; Nelson Maculan (Discret. Appl. Math., 1993)

Using the tabu search method for the distribution of supplies in a hospital. - Philippe Michelon; Marcelo Dib Cruz; Viviane Gascon (Ann. Oper. Res., 1994)

A Scatter Search Approach for Unconstrained Continuous Optimization. - Charles Fleurent; Fred W. Glover; Philippe Michelon; Zulficar Valli (International Conference on Evolutionary Computation, 1996)

A scatter search based approach for the quadratic assignment problem. - Van-Dat Cung; Thierry Mautor; Philippe Michelon; A. Tavares (ICEC, 1997)

Scheduling the flying squad nurses of a hospital using a multi-objective programming model. - Viviane Gascon; Sophie Villeneuve; Philippe Michelon; Jacques A. Ferland (Ann. Oper. Res., 2000)

The Euclidean Steiner tree problem in Rn: A mathematical programming formulation. - Nelson Maculan; Philippe Michelon; Adilson Elias Xavier (Ann. Oper. Res., 2000)

Generalized Assignment Type Goal Programming Problem: Application to Nurse Scheduling. - Jacques A. Ferland; Ilham Berrada; Imene Nabli; B. Ahiod; Philippe Michelon; Viviane Gascon; Éric Gagné (J. Heuristics, 2001)

Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée. - Philippe Michelon; Stéphanie Ripeau; Nelson Maculan (RAIRO Oper. Res., 2001)

Insertion techniques for static and dynamic resource-constrained project scheduling. - Christian Artigues; Philippe Michelon; Stéphane Reusser (Eur. J. Oper. Res., 2003)

LSSPER: Solving the Resource-Constrained Project Scheduling Problem with Large Neighbourhood Search. - Mireille Palpant; Christian Artigues; Philippe Michelon (Ann. Oper. Res., 2004)

"Miniaturized" Linearizations for Quadratic 0/1 Problems. - Serigne Gueye; Philippe Michelon (Ann. Oper. Res., 2005)

Preface. - Lorena Pradenas; Roger Z. Ríos-Mercado; Jacques A. Ferland; Robert Scherer; Philippe Michelon; Nelson Maculan (Ann. Oper. Res., 2005)

Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem. - Sophie Demassey; Christian Artigues; Philippe Michelon (INFORMS J. Comput., 2005)

Editorial. - Christian Artigues; Dominique Feillet; Philippe Michelon (RAIRO Oper. Res., 2006)

Solution of a Facility Layout Problem in a Final Assembly Workshop using Constraint Programming. - Fabrice Alizon; Yves Dallery; Dominique Feillet; Philippe Michelon (INFOR Inf. Syst. Oper. Res., 2007)

Recent Hybrid Techniques for the Multi-Knapsack Problem. - Carlos Diego Rodrigues; Philippe Michelon; Manoel B. Campêlo (CP, 2008)

On a class of periodic scheduling problems: Models, lower bounds and heuristics. - Philippe Michelon; Dominique Quadri; Marcos Negreiros (IMCSIT, 2008)

A constraint programming approach for the resource-constrained project scheduling problem. - Olivier Liess; Philippe Michelon (Ann. Oper. Res., 2008)

Models and methods for frequency assignment with cumulative interference constraints. - Mireille Palpant; Cristian Oliva; Christian Artigues; Philippe Michelon; Mohamed Didi Biha (Int. Trans. Oper. Res., 2008)

Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations. - Rodrigo Acuna-Agost; Philippe Michelon; Dominique Feillet; Serigne Gueye (CPAIOR, 2009)

Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search - Sylvain Boussier; Michel Vasquez; Yannick Vimont; Saïd Hanafi; Philippe Michelon (CoRR, 2009)

A linearization framework for unconstrained quadratic (0-1) problems. - Serigne Gueye; Philippe Michelon (Discret. Appl. Math., 2009)

The dynamic frequency assignment problem. - Audrey Dupont; Andréa Carneiro Linhares; Christian Artigues; Dominique Feillet; Philippe Michelon; Michel Vasquez (Eur. J. Oper. Res., 2009)

Solving the Frequency Assignment Problem by Site Availability and Constraint Programming - Andréa Carneiro Linhares; Juan-Manuel Torres-Moreno; Peter Peinl; Philippe Michelon (CoRR, 2010)

A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem. - Sylvain Boussier; Michel Vasquez; Yannick Vimont; Saïd Hanafi; Philippe Michelon (Discret. Appl. Math., 2010)

An Exact Site Availability Approach to Modeling the D-FAP. - Andréa Carneiro Linhares; Philippe Michelon; Dominique Feillet (Electron. Notes Discret. Math., 2010)

Crop rotation scheduling with adjacency constraints. - Lana Mara Rodrigues dos Santos; Philippe Michelon; Marcos Nereu Arenales; Ricardo Henrique Silva Santos (Ann. Oper. Res., 2011)

Generalized resolution search. - Marius Posta; Jacques A. Ferland; Philippe Michelon (Discret. Optim., 2011)

SAPI: Statistical Analysis of Propagation of Incidents. A new approach for rescheduling trains after disruptions. - Rodrigo Acuna-Agost; Philippe Michelon; Dominique Feillet; Serigne Gueye (Eur. J. Oper. Res., 2011)

A MIP-based local search method for the railway rescheduling problem. - Rodrigo Acuna-Agost; Philippe Michelon; Dominique Feillet; Serigne Gueye (Networks, 2011)

An exact method with variable fixing for solving the generalized assignment problem. - Marius Posta; Jacques A. Ferland; Philippe Michelon (Comput. Optim. Appl., 2012)

0-1 Quadratic Knapsack Problems: An Exact Approach Based on a t-Linearization. - Carlos Diego Rodrigues; Dominique Quadri; Philippe Michelon; Serigne Gueye (SIAM J. Optim., 2012)

A Heuristic Procedure with Local Branching for the Fixed Charge Network Design Problem with User-optimal Flow. - Pedro Henrique González 001; Luidi Gelabert Simonetti; Carlos Alberto de Jesus Martinhon; Philippe Yves Paul Michelon; Edcarllos Santos (ICEIS (1), 2014)

An Improved Relax-and-Fix Algorithm for the Fixed Charge Network Design Problem with User-optimal Flow. - Pedro Henrique González 001; Luidi Gelabert Simonetti; Carlos Alberto de Jesus Martinhon; Edcarllos Santos; Philippe Yves Paul Michelon (ICORES, 2014)

A Relax and Fix Approach to Solve the Fixed Charge Network Design Problem with User-Optimal Flow. - Pedro Henrique González 001; Luidi Gelabert Simonetti; Carlos Alberto de Jesus Martinhon; Edcarllos Santos; Philippe Yves Paul Michelon (ICORES (Selected Papers), 2014)

A Bit-Parallel Russian Dolls Search for a Maximum Cardinality Clique in a Graph. - Ricardo C. Corrêa; Philippe Michelon; Bertrand Le Cun; Thierry Mautor; Diego Delle Donne (CoRR, 2014)

An exact cooperative method for the uncapacitated facility location problem. - Marius Posta; Jacques A. Ferland; Philippe Michelon (Math. Program. Comput., 2014)

Relevance of Negative Links in Graph Partitioning: A Case Study Using Votes from the European Parliament. - Israel Mendonça; Rosa Figueiredo 001; Vincent Labatut; Philippe Michelon (ENIC, 2015)

A linear formulation with O(n2) variables for quadratic assignment problems with Manhattan distance matrices. - Serigne Gueye; Philippe Michelon (EURO J. Comput. Optim., 2015)

A scheduling model for astronomy. - Mauricio Solar; Philippe Michelon; Jorge Avarias; Mario Garcés (Astron. Comput., 2016)

A variable fixing heuristic with Local Branching for the fixed charge uncapacitated network design problem with user-optimal flow. - Pedro Henrique González 001; Luidi Simonetti; Philippe Michelon; Carlos Alberto de Jesus Martinhon; Edcarllos Santos (Comput. Oper. Res., 2016)

Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties. - Bruno Ferreira Rosa; Marcone Jamilson Freitas Souza; Sérgio Ricardo de Souza; Moacir Felizardo de França Filho; Zacharie Alès; Philippe Yves Paul Michelon (Comput. Oper. Res., 2017)

A Neighborhood Exploration Approach with Multi-start for Extend Generalized Block-modeling. - Micheli Knechtel; Philippe Michelon; Serigne Gueye; Luiz Satoru Ochi (Electron. Notes Discret. Math., 2018)

General Variable Neighborhood Search for the Data Mule Scheduling Problem. - Pablo Luiz Araújo Munhoz; Pedro Henrique González 001; Uéverton dos Santos Souza; Luiz Satoru Ochi; Philippe Michelon; Lúcia Maria de A. Drummond (Electron. Notes Discret. Math., 2018)

Locality Sensitive Algotrithms for Data Mule Routing Problem. - Pablo Luiz Araújo Munhoz; Felipe P. do Carmo; Uéverton S. Souza; Lúcia M. A. Drummond; Pedro Henrique González 001; Luiz S. Ochi; Philippe Michelon (AAIM, 2019)

Valid constraints for time-indexed formulations of job scheduling problems with distinct time windows and sequence-dependent setup times. - Bruno Ferreira Rosa; Marcone Jamilson Freitas Souza; Sérgio Ricardo de Souza; Zacharie Alès; Philippe Yves Paul Michelon (INOC, 2019)

Solving the minimum labeling global cut problem by mathematical programming. - Thiago Gouveia da Silva; Gilberto Farias de Sousa Filho; Luiz Satoru Ochi; Philippe Michelon; Serigne Gueye; Lucídio A. F. Cabral (CoRR, 2019)

A polyhedral approach to the generalized minimum labeling spanning tree problem. - Thiago Gouveia da Silva; Serigne Gueye; Philippe Michelon; Luiz Satoru Ochi; Lucídio dos Anjos Formiga Cabral (EURO J. Comput. Optim., 2019)

A hybrid metaheuristic for the minimum labeling spanning tree problem. - Thiago Gouveia da Silva; Eduardo Queiroga; Luiz Satoru Ochi; Lucídio dos Anjos Formiga Cabral; Serigne Gueye; Philippe Michelon (Eur. J. Oper. Res., 2019)

New proposals for modelling and solving the problem of covering solids using spheres of different radii. - Pedro Henrique González Silva; Ana Flávia Uzeda dos Santos Macambira; Renan Vicente Pinto; Luidi Simonetti; Nelson Maculan; Philippe Michelon (RAIRO Oper. Res., 2020)

Integer and constraint programming approaches for providing optimality to the bandwidth multicoloring problem. - Bruno Dias; Rosiane de Freitas Rodrigues; Nelson Maculan; Philippe Michelon (RAIRO Oper. Res., 2021)