Philippe Michelon

Orcid: 0000-0001-6648-5651

Affiliations:
  • Université d'Avignon et des Pays de Vaucluse, Avignon, France


According to our database1, Philippe Michelon authored at least 52 papers between 1991 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Integer and constraint programming approaches for providing optimality to the bandwidth multicoloring problem.
RAIRO Oper. Res., 2021

2020
New proposals for modelling and solving the problem of covering solids using spheres of different radii.
RAIRO Oper. Res., 2020

2019
A hybrid metaheuristic for the minimum labeling spanning tree problem.
Eur. J. Oper. Res., 2019

A polyhedral approach to the generalized minimum labeling spanning tree problem.
EURO J. Comput. Optim., 2019

Solving the minimum labeling global cut problem by mathematical programming.
CoRR, 2019

Valid constraints for time-indexed formulations of job scheduling problems with distinct time windows and sequence-dependent setup times.
Proceedings of the 9th International Network Optimization Conference, 2019

Locality Sensitive Algotrithms for Data Mule Routing Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018
General Variable Neighborhood Search for the Data Mule Scheduling Problem.
Electron. Notes Discret. Math., 2018

A Neighborhood Exploration Approach with Multi-start for Extend Generalized Block-modeling.
Electron. Notes Discret. Math., 2018

2017
Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties.
Comput. Oper. Res., 2017

2016
A variable fixing heuristic with Local Branching for the fixed charge uncapacitated network design problem with user-optimal flow.
Comput. Oper. Res., 2016

A scheduling model for astronomy.
Astron. Comput., 2016

2015
A linear formulation with O(n<sup>2</sup>) variables for quadratic assignment problems with Manhattan distance matrices.
EURO J. Comput. Optim., 2015

Relevance of Negative Links in Graph Partitioning: A Case Study Using Votes from the European Parliament.
Proceedings of the 2015 Second European Network Intelligence Conference, 2015

2014
An exact cooperative method for the uncapacitated facility location problem.
Math. Program. Comput., 2014

A Bit-Parallel Russian Dolls Search for a Maximum Cardinality Clique in a Graph.
CoRR, 2014

A Relax and Fix Approach to Solve the Fixed Charge Network Design Problem with User-Optimal Flow.
Proceedings of the Operations Research and Enterprise Systems, 2014

An Improved Relax-and-Fix Algorithm for the Fixed Charge Network Design Problem with User-optimal Flow.
Proceedings of the ICORES 2014, 2014

A Heuristic Procedure with Local Branching for the Fixed Charge Network Design Problem with User-optimal Flow.
Proceedings of the ICEIS 2014, 2014

2012
0-1 Quadratic Knapsack Problems: An Exact Approach Based on a t-Linearization.
SIAM J. Optim., 2012

An exact method with variable fixing for solving the generalized assignment problem.
Comput. Optim. Appl., 2012

2011
A MIP-based local search method for the railway rescheduling problem.
Networks, 2011

SAPI: Statistical Analysis of Propagation of Incidents. A new approach for rescheduling trains after disruptions.
Eur. J. Oper. Res., 2011

Generalized resolution search.
Discret. Optim., 2011

Crop rotation scheduling with adjacency constraints.
Ann. Oper. Res., 2011

2010
An Exact Site Availability Approach to Modeling the D-FAP.
Electron. Notes Discret. Math., 2010

A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem.
Discret. Appl. Math., 2010

Solving the Frequency Assignment Problem by Site Availability and Constraint Programming
CoRR, 2010

2009
The dynamic frequency assignment problem.
Eur. J. Oper. Res., 2009

A linearization framework for unconstrained quadratic (0-1) problems.
Discret. Appl. Math., 2009

Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search
CoRR, 2009

Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2009

2008
Models and methods for frequency assignment with cumulative interference constraints.
Int. Trans. Oper. Res., 2008

A constraint programming approach for the resource-constrained project scheduling problem.
Ann. Oper. Res., 2008

On a class of periodic scheduling problems: Models, lower bounds and heuristics.
Proceedings of the International Multiconference on Computer Science and Information Technology, 2008

Recent Hybrid Techniques for the Multi-Knapsack Problem.
Proceedings of the Principles and Practice of Constraint Programming, 2008

2007
Solution of a Facility Layout Problem in a Final Assembly Workshop using Constraint Programming.
INFOR Inf. Syst. Oper. Res., 2007

2006
Editorial.
RAIRO Oper. Res., 2006

2005
Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem.
INFORMS J. Comput., 2005

Preface.
Ann. Oper. Res., 2005

"Miniaturized" Linearizations for Quadratic 0/1 Problems.
Ann. Oper. Res., 2005

2004
LSSPER: Solving the Resource-Constrained Project Scheduling Problem with Large Neighbourhood Search.
Ann. Oper. Res., 2004

2003
Insertion techniques for static and dynamic resource-constrained project scheduling.
Eur. J. Oper. Res., 2003

2001
Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée.
RAIRO Oper. Res., 2001

Generalized Assignment Type Goal Programming Problem: Application to Nurse Scheduling.
J. Heuristics, 2001

2000
The Euclidean Steiner tree problem in R<sup>n</sup>: A mathematical programming formulation.
Ann. Oper. Res., 2000

Scheduling the flying squad nurses of a hospital using a multi-objective programming model.
Ann. Oper. Res., 2000

1996
A Scatter Search Approach for Unconstrained Continuous Optimization.
Proceedings of 1996 IEEE International Conference on Evolutionary Computation, 1996

1994
Using the tabu search method for the distribution of supplies in a hospital.
Ann. Oper. Res., 1994

1993
Lagrangean Methods for 0-1 Quadratic Problems.
Discret. Appl. Math., 1993

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

1991
Lagrangean decomposition for integer nonlinear programming with linear constraints.
Math. Program., 1991


  Loading...