Nos tutelles

CNRS Dauphine PSL *

Rechercher





Accueil > PERSONNES

Membres

publié le , mis à jour le

retour a la liste des membres

Fabio Furini

Email : fabio.furini@dauphine.fr

Tel : (+33) 1 44 05 48 00
Bureau : p632
Site Personnel: http://www.lamsade.dauphine.fr/~furini/doku.php
Pole : Optimisation combinatoire algorithmique
Status : Maitre de conférence

Encadrement de these de doctorat :


  • Ian-christopher Ternier : Coloration de graphes par branch-and-price ( Début : 2014-10-01)
  • Xueying Shen : Modèle d'optimisation robuste en environnements dynamiques appliqués à la production et à la logistique ( Début : 2015-01-01)
voir toutes les theses

Publications Dblp


Publications DFIS


Publications HAL


18 An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem (, and ), In Networks, volume 69, . [bibtex] [pdf] [doi]

17 Solving vertex coloring problems as maximum weight stable set problems (, and ), In Discrete Applied Mathematics, Elsevier, volume 217 (Part 2), . [bibtex] [pdf] [doi]

16 MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover (, , , and ), In 4th International Symposium, ISCO 2016, . [bibtex] [pdf] [doi]

15 The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace (, and ), In Transportation Research Part B: Methodological, Elsevier, volume 90, . [bibtex] [pdf] [doi]

14 Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming (, and ), In INFORMS Journal on Computing, volume 28, . [bibtex] [pdf] [doi]

13 Lower Bounding Techniques for DSATUR-based Branch and Bound (, and ), In Electronic Notes in Discrete Mathematics, volume 52, . [bibtex] [pdf] [doi]

12 Approximated perspective relaxations: a project and lift approach (, and ), In Computational Optimization and Applications, Springer Verlag, volume 63, . [bibtex] [pdf] [doi]

11 Solving the Temporal Knapsack Problem via Recursive Dantzig–Wolfe Reformulation (, , and ), In Information Processing Letters, volume 116, . [bibtex] [pdf] [doi]

10 Approaches to a real-world Train Timetabling Problem in a railway node (, and ), In Omega, volume 58, . [bibtex] [pdf] [doi]

9 ILP and CP Formulations for the Lazy Bureaucrat Problem (, and ), In 12th International Conference, CPAIOR 2015, . [bibtex] [pdf] [doi]

8 Mathematical models for real-world production planning problems with sequence-dependent set-up costs (, , , and ), In ROADEF 2015, . [bibtex] [pdf]

7 Improved rolling horizon approaches to the aircraft sequencing problem (, , and ), In Journal of Scheduling, volume 18, . [bibtex] [pdf] [doi]

6 Automatic Dantzig–Wolfe reformulation of mixed integer programs (, , , , , and ), In Mathematical Programming, volume 149, . [bibtex] [pdf] [doi]

5 Mathematical formulations for the Balanced Vertex k-Separator Problem (, , , , and ), In International Conference on Control, Decision and Information Technologies (CoDIT), . [bibtex] [pdf] [doi]

4 Mathematical Formulations for the Balanced Vertex k-Separator Problem (, , , , and ), In 2014 INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT) (Kacem, I, Laroche, P, Roka, Z, eds.), . [bibtex] [pdf]

3 State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting (, , and ), In ISCO 2014 - 3rd International Symposium on Combinatorial Optimization, . [bibtex] [pdf] [doi]

2 Two useful computational tricks for Quadratic Programming: hybrid SDP bounding procedures and a new linearisation technique ( and ), In ROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, . [bibtex] [pdf]

1 Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics (, , , , and ), In IEEE Transactions on Signal Processing, volume 62, . [bibtex] [pdf] [doi]