Philippe Baptiste

Engineering · Physical Sciences

28h-index2.8kcitations98works0.02yr avg
OpenAlex↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Scheduling and Optimization Algorithms(61), Optimization and Search Problems(33), Constraint Satisfaction and Optimization(21), Optimization and Packing Problems(16), Scheduling and Timetabling Solutions(12)

Publications98 total

Le spatial en Guyane face aux enjeux de la transition énergétique
Annales des Mines - Réalités industrielles·2023
Innover dans le spatial
Hors les murs·2021
Redundant cumulative constraints to compute preemptive bounds
Discrete Applied Mathematics·2017· 5 cited
Graphs with maximal induced matchings of the same size
Discrete Applied Mathematics·2016· 4 citedOpen Access
Nouvelles bornes pour le RCPSP par reformulation de ressources cumulatives
HAL (Le Centre pour la Communication Scientifique Directe)·2014
Branch-and-bound Algorithms for total weighted tardiness.
HAL (Le Centre pour la Communication Scientifique Directe)·2014· 14 cited
Polynomial-time algorithms for minimum energy scheduling
ACM Transactions on Algorithms·2012· 28 citedOpen Access
Graphs with Maximal Induced Matchings of the Same Size
IFAC Proceedings Volumes·2012· 3 cited
Polynomial Time Algorithms for Minimum Energy Scheduling
2010· 3 citedOpen Access
A note on scheduling identical coupled tasks in logarithmic time
Discrete Applied Mathematics·2009· 17 cited
Preface
Journal of Scheduling·2009
Polynomial Time Algorithms for Minimum Energy Scheduling
arXiv (Cornell University)·2009· 3 citedOpen Access
Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars
European Journal of Operational Research·2009· 12 citedOpen Access
On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
Naval Research Logistics (NRL)·2009· 15 cited
Constraint-Based Schedulers, Do They Really Work?
Lecture notes in computer science·2009· 2 cited
Integrality Property in Preemptive Parallel Machine Scheduling
Lecture notes in computer science·2009· 4 cited
Planification, ordonnancement : résolution de problèmes disjonctifs
HAL (Le Centre pour la Communication Scientifique Directe)·2009
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks
Lecture notes in computer science·2008· 5 cited
Fast paths in large-scale dynamic road networks
Computational Optimization and Applications·2008· 33 cited
Formulations PLNE pour l'ordonnancement des chaînes sur une machine
HAL (Le Centre pour la Communication Scientifique Directe)·2008Open Access
page 1 of 5Next →

Frequent Co-authors

Claude Le Pape(11), Christoph Dürr(5), Antoine Jouglet(5), Marek Chrobák(4), Jacques Carlier(4), Wim Nuijten(3), Konstantin Artiouchine(3), Peter Brucker(3), N. Okwor Anthony A. Adeyeye Emmanuel(2), Francis Sourd(2), Laurent Péridy(2), Sophie Demassey(2), Philippe Laborie(2), Huy Trandac(2), Vũ Dương(2), David Savourey(2), Vadim G. Timkovsky(2), Ruslan Sadykov(2), Jatinder N.D. Gupta(1), H. Bougault(1)