default search action
Philippe Michelon
Person information
- affiliation: Université d'Avignon et des Pays de Vaucluse, Avignon, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j38]Bruno Dias
, Rosiane de Freitas Rodrigues
Integer and constraint programming approaches for providing optimality to the bandwidth multicoloring problem. RAIRO Oper. Res. 55(Supplement): S1949-S1967 (2021) - 2020
- [j37]Pedro Henrique González Silva, Ana Flávia Uzeda dos Santos Macambira, Renan Vicente Pinto, Luidi Simonetti
New proposals for modelling and solving the problem of covering solids using spheres of different radii. RAIRO Oper. Res. 54(3): 873-882 (2020)
2010 – 2019
- 2019
- [j36]Thiago Gouveia da Silva
A polyhedral approach to the generalized minimum labeling spanning tree problem. EURO J. Comput. Optim. 7(1): 47-77 (2019) - [j35]Thiago Gouveia da Silva
A hybrid metaheuristic for the minimum labeling spanning tree problem. Eur. J. Oper. Res. 274(1): 22-34 (2019) - [c10]Pablo Luiz Araújo Munhoz, Felipe P. do Carmo, Uéverton S. Souza
Locality Sensitive Algotrithms for Data Mule Routing Problem. AAIM 2019: 236-248 - [c9]Bruno Ferreira Rosa, Marcone Jamilson Freitas Souza, Sérgio Ricardo de Souza, Zacharie Alès, Philippe Yves Paul Michelon:
Valid constraints for time-indexed formulations of job scheduling problems with distinct time windows and sequence-dependent setup times. INOC 2019: 43-48 - [i6]Thiago Gouveia da Silva, Gilberto Farias de Sousa Filho, Luiz Satoru Ochi, Philippe Michelon, Serigne Gueye, Lucídio A. F. Cabral:
Solving the minimum labeling global cut problem by mathematical programming. CoRR abs/1903.04319 (2019) - 2018
- [j34]Micheli Knechtel, Philippe Michelon
A Neighborhood Exploration Approach with Multi-start for Extend Generalized Block-modeling. Electron. Notes Discret. Math. 66: 63-70 (2018) - [j33]Pablo Luiz Araújo Munhoz, Pedro Henrique González
General Variable Neighborhood Search for the Data Mule Scheduling Problem. Electron. Notes Discret. Math. 66: 71-78 (2018) - 2017
- [j32]Bruno Ferreira Rosa, Marcone Jamilson Freitas Souza
Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties. Comput. Oper. Res. 81: 203-215 (2017) - 2016
- [j31]Mauricio Solar
A scheduling model for astronomy. Astron. Comput. 15: 90-104 (2016) - [j30]Pedro Henrique González
A variable fixing heuristic with Local Branching for the fixed charge uncapacitated network design problem with user-optimal flow. Comput. Oper. Res. 76: 134-146 (2016) - 2015
- [j29]Serigne Gueye, Philippe Michelon
A linear formulation with O(n2) variables for quadratic assignment problems with Manhattan distance matrices. EURO J. Comput. Optim. 3(2): 79-110 (2015) - [c8]Israel Mendonça
Relevance of Negative Links in Graph Partitioning: A Case Study Using Votes from the European Parliament. ENIC 2015: 122-129 - [i5]Pedro Henrique González, Luidi Simonetti, Philippe Michelon, Carlos Alberto de Jesus Martinhon, Edcarllos Santos:
A Variable Fixing Heuristic with Local Branching for the Fixed Charge Uncapacitated Network Design Problem with User-optimal Flow. CoRR abs/1504.03217 (2015) - [i4]Israel Mendonça, Rosa Figueiredo, Vincent Labatut, Philippe Michelon
Relevance of Negative Links in Graph Partitioning: A Case Study Using Votes From the European Parliament. CoRR abs/1507.04215 (2015) - 2014
- [j28]Marius Posta, Jacques A. Ferland, Philippe Michelon:
An exact cooperative method for the uncapacitated facility location problem. Math. Program. Comput. 6(3): 199-231 (2014) - [c7]Pedro Henrique González, Luidi Gelabert Simonetti
A Heuristic Procedure with Local Branching for the Fixed Charge Network Design Problem with User-optimal Flow. ICEIS (1) 2014: 384-394 - [c6]Pedro Henrique González, Luidi Gelabert Simonetti
An Improved Relax-and-Fix Algorithm for the Fixed Charge Network Design Problem with User-optimal Flow. ICORES 2014: 100-107 - [c5]Pedro Henrique González
A Relax and Fix Approach to Solve the Fixed Charge Network Design Problem with User-Optimal Flow. ICORES (Selected Papers) 2014: 173-185 - [i3]Ricardo C. Corrêa, Philippe Michelon, Bertrand Le Cun, Thierry Mautor, Diego Delle Donne:
A Bit-Parallel Russian Dolls Search for a Maximum Cardinality Clique in a Graph. CoRR abs/1407.1209 (2014) - 2012
- [j27]Marius Posta, Jacques A. Ferland, Philippe Michelon
An exact method with variable fixing for solving the generalized assignment problem. Comput. Optim. Appl. 52(3): 629-644 (2012) - [j26]Carlos Diego Rodrigues, Dominique Quadri, Philippe Michelon
0-1 Quadratic Knapsack Problems: An Exact Approach Based on a t-Linearization. SIAM J. Optim. 22(4): 1449-1468 (2012) - 2011
- [j25]Lana Mara Rodrigues dos Santos, Philippe Michelon
Crop rotation scheduling with adjacency constraints. Ann. Oper. Res. 190(1): 165-180 (2011) - [j24]Marius Posta, Jacques A. Ferland, Philippe Michelon
Generalized resolution search. Discret. Optim. 8(2): 215-228 (2011) - [j23]Rodrigo Acuna-Agost, Philippe Michelon, Dominique Feillet
SAPI: Statistical Analysis of Propagation of Incidents. A new approach for rescheduling trains after disruptions. Eur. J. Oper. Res. 215(1): 227-243 (2011) - [j22]Rodrigo Acuna-Agost, Philippe Michelon
A MIP-based local search method for the railway rescheduling problem. Networks 57(1): 69-86 (2011) - 2010
- [j21]Sylvain Boussier, Michel Vasquez, Yannick Vimont, Saïd Hanafi, Philippe Michelon
A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem. Discret. Appl. Math. 158(2): 97-109 (2010) - [j20]Andréa Carneiro Linhares, Philippe Michelon, Dominique Feillet
An Exact Site Availability Approach to Modeling the D-FAP. Electron. Notes Discret. Math. 36: 1-8 (2010) - [i2]Andréa Carneiro Linhares, Juan-Manuel Torres-Moreno, Peter Peinl, Philippe Michelon:
Solving the Frequency Assignment Problem by Site Availability and Constraint Programming. CoRR abs/1001.1093 (2010)
2000 – 2009
- 2009
- [j19]Serigne Gueye, Philippe Michelon
A linearization framework for unconstrained quadratic (0-1) problems. Discret. Appl. Math. 157(6): 1255-1266 (2009) - [j18]Audrey Dupont, Andréa Carneiro Linhares, Christian Artigues, Dominique Feillet
The dynamic frequency assignment problem. Eur. J. Oper. Res. 195(1): 75-88 (2009) - [c4]Rodrigo Acuna-Agost, Philippe Michelon
Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations. CPAIOR 2009: 312-313 - [i1]Sylvain Boussier, Michel Vasquez, Yannick Vimont, Saïd Hanafi, Philippe Michelon
Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search. CoRR abs/0905.0848 (2009) - 2008
- [j17]Olivier Liess, Philippe Michelon
A constraint programming approach for the resource-constrained project scheduling problem. Ann. Oper. Res. 157(1): 25-36 (2008) - [j16]Mireille Palpant, Cristian Oliva, Christian Artigues, Philippe Michelon
Models and methods for frequency assignment with cumulative interference constraints. Int. Trans. Oper. Res. 15(3): 307-324 (2008) - [c3]Carlos Diego Rodrigues, Philippe Michelon
Recent Hybrid Techniques for the Multi-Knapsack Problem. CP 2008: 555-559 - [c2]Philippe Michelon
On a class of periodic scheduling problems: Models, lower bounds and heuristics. IMCSIT 2008: 899-906 - 2007
- [j15]Fabrice Alizon, Yves Dallery, Dominique Feillet, Philippe Michelon:
Solution of a Facility Layout Problem in a Final Assembly Workshop using Constraint Programming. INFOR Inf. Syst. Oper. Res. 45(2): 65-73 (2007) - 2006
- [j14]Christian Artigues, Dominique Feillet
Editorial. RAIRO Oper. Res. 40(2): 75-76 (2006) - 2005
- [j13]Lorena Pradenas
Preface. Ann. Oper. Res. 138(1): 19-20 (2005) - [j12]Serigne Gueye, Philippe Michelon
"Miniaturized" Linearizations for Quadratic 0/1 Problems. Ann. Oper. Res. 140(1): 235-261 (2005) - [j11]Sophie Demassey
Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem. INFORMS J. Comput. 17(1): 52-65 (2005) - 2004
- [j10]Mireille Palpant, Christian Artigues, Philippe Michelon
LSSPER: Solving the Resource-Constrained Project Scheduling Problem with Large Neighbourhood Search. Ann. Oper. Res. 131(1-4): 237-257 (2004) - 2003
- [j9]Christian Artigues, Philippe Michelon, Stéphane Reusser:
Insertion techniques for static and dynamic resource-constrained project scheduling. Eur. J. Oper. Res. 149(2): 249-267 (2003) - 2001
- [j8]Jacques A. Ferland, Ilham Berrada, Imene Nabli, B. Ahiod, Philippe Michelon
Generalized Assignment Type Goal Programming Problem: Application to Nurse Scheduling. J. Heuristics 7(4): 391-413 (2001) - [j7]Philippe Michelon, Stéphanie Ripeau, Nelson Maculan:
Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée. RAIRO Oper. Res. 35(4): 401-414 (2001) - 2000
- [j6]Viviane Gascon, Sophie Villeneuve, Philippe Michelon, Jacques A. Ferland:
Scheduling the flying squad nurses of a hospital using a multi-objective programming model. Ann. Oper. Res. 96(1-4): 149-166 (2000) - [j5]Nelson Maculan, Philippe Michelon, Adilson Elias Xavier:
The Euclidean Steiner tree problem in Rn: A mathematical programming formulation. Ann. Oper. Res. 96(1-4): 209-220 (2000)
1990 – 1999
- 1996
- [c1]Charles Fleurent, Fred W. Glover, Philippe Michelon, Zulficar Valli:
A Scatter Search Approach for Unconstrained Continuous Optimization. International Conference on Evolutionary Computation 1996: 643-648 - 1994
- [j4]Philippe Michelon, Marcelo Dib Cruz, Viviane Gascon:
Using the tabu search method for the distribution of supplies in a hospital. Ann. Oper. Res. 50(1): 427-435 (1994) - 1993
- [j3]Philippe Michelon, Nelson Maculan:
Lagrangean Methods for 0-1 Quadratic Problems. Discret. Appl. Math. 42(2): 257-269 (1993) - 1992
- [j2]Philippe Michelon:
Unconstrained 0-1 nonlinear programming: A nondifferentiable approach. J. Glob. Optim. 2(2): 155-165 (1992) - 1991
- [j1]Philippe Michelon, Nelson Maculan:
Lagrangean decomposition for integer nonlinear programming with linear constraints. Math. Program. 52: 303-313 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: