Nhóm nghiên cứu hiện hành :	ACASA ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MLIA MOCAH MoVe NPA PEQUAN Phare PolSys QI RO SMA SYEL Whisper
Các nhóm nghiên cứu trước đây :	AnimatLab MALIRE REGAL SALSA SPI SPIRAL
Các đề tài nghiên cứu trước đây :	ANP APA ASIM CALFOR OASIS RP SPI SRC SYSDEF

Bài báo khoa học DECISION	2015	2016	2017	2018	2019	2020	Total
Sách	0	0	0	0	0	0	0
Soạn thảo sách	0	0	0	1	0	0	1
Bài báo khoa học	12	15	13	8	4	4	56
Chương sách	0	2	2	0	0	2	6
Bài hội thảo khoa học	29	25	14	10	20	11	109
Luận án tiến sĩ khoa học	0	1	0	0	0	0	1
Luận án tiến sĩ	1	3	4	1	0	0	9

LIP6

• F. Abu‑Khzam, C. Bazgan, M. Chopin, H. Fernau : “Data Reductions and Combinatorial Bounds for Improved Approximation Algorithms”, Journal of Computer and System Sciences, vol. 82 (3), (Elsevier) [Abu-Khzam 2016]
• C. Baudrit, S. Destercke, P.‑H. Wuillemin : “Unifying parameter learning and modelling complex systems with epistemic uncertainty using probability interval”, Information Sciences, vol. 367-368, pp. 630–647, (Elsevier) [Baudrit 2016]
• M. Boujelben, C. Gicquel, M. Minoux : “A MILP model and heuristic approach for facility location under multiple operational constraints”, Computers and Industrial Engineering, vol. 96, pp. 446-461, (Elsevier) [Boujelben 2016]
• S. Dubuisson, Ch. Gonzales : “A survey of datasets for visual tracking”, Machine Vision and Applications, vol. 27 (1), pp. 23-52, (Springer Verlag) [Dubuisson 2016]
• M. S. Ibrahim, N. Maculan, H. Ouzia : “An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs”, RAIRO - Operations Research, vol. 50 (3), pp. 665-675, (EDP Sciences) [Ibrahim 2016]
• A. Ismaili, P. Perny : “Computational Social Choice for Coordination in Agent Networks”, Annals of Mathematics and Artificial Intelligence, vol. 77 (3), pp. 335-359, (Springer Verlag) [Ismaili 2016]
• J.‑Ch. Magnan, P.‑H. Wuillemin : “Efficient Incremental Planning and Learning with Multi-Valued Decision Diagrams”, Journal of Applied Logic, (Elsevier) [Magnan 2016]
• M. Minoux, R. Zorgati : “Convexity of Gaussian chance constraints and of related probability maximization problems”, Computational Statistics, vol. 31 (1), pp. 387-408, (Springer Verlag) [Minoux 2016b]
• D. Nguyen, M. Minoux, V. Nguyen, Th. Nguyen, R. Sirdey : “Improved compact formulations for a wide class of graph partitioning problems in sparse graphs”, Discrete Optimization, (Elsevier) [Nguyen 2016a]
• V. Nguyen, M. Minoux : “Improved linearized models for Graph Partitioning Problem under Capacity Constraints”, Optimization Methods and Software, (Taylor & Francis) [Nguyen 2016a]
• V. Nguyen, M. Minoux, D. Nguyen : “Improved compact formulations for metric and cut polyhedra”, Electronic Notes in Discrete Mathematics, vol. 52, pp. 125-132, (Elsevier) [Nguyen 2016b]
• D. Nguyen, M. Minoux, V. Nguyen, Th. Nguyen, R. Sirdey : “Stochastic graph partitioning: quadratic versus SOCP formulations”, Optimization Letters, vol. 10 (7), pp. 1505–1518, (Springer Verlag) [Nguyen 2016b]
• V. Nguyen, M. Minoux, D. Nguyen : “Reduced-size formulations for metric and cut polyhedra in sparse graphs”, Networks, (Wiley) [Nguyen 2016c]
• N. Perrot, H. DE VRIES, E. Lutton, Harald G. J. Van Mil, M. DONNER, A. Tonda, S. Martin, I. Alvarez, P. Bourgine, E. Van Der Linden, M. Axelos : “Some remarks on computational approaches towards sustainable complex agri-food systems”, Trends in Food Science and Technology, vol. 48, pp. 88-101, (Elsevier) [Perrot 2016]
• G. Pigozzi, A. Tsoukiàs, P. Viappiani : “Preferences in Artificial Intelligence”, Annals of Mathematics and Artificial Intelligence, vol. 77 (3-4), pp. 361-401, (Springer Verlag) [Pigozzi 2016]