Sébastien Martin

CoRR, 2022

A Feasibility Study on Real-Time High Resolution Imaging of the Brain Using Electrical Impedance Tomography.

[BibT_eX]

[DOI]

CoRR, 2022

Constrained shortest path tour problem: Branch-and-Price algorithm.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2022

Real-Time Rideshare Driver Supply Values Using Online Reinforcement Learning.

[BibT_eX]

[DOI]

Benjamin Han

Hyungjun Lee

Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

Branch-and-Benders-Cut Algorithm for the Weighted Coflow Completion Time Minimization Problem.

[BibT_eX]

[DOI]

Mohamed Yassine Naghmouchi

Jérémie Leguay

Francesco De Pellegrini

Rachid Elazouzi

Cédric Richier

Proceedings of the 10th International Network Optimization Conference, 2022

Resource Defragmentation for Network Slicing.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2022, 2022

Intent-Based Routing Policy Optimization in SD-WAN.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2022

Scalable Damper-based Deterministic Networking.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Network and Service Management, 2022

2021

Tire noise optimization problem: a mixed integer linear programming approach.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2021

The multi-terminal vertex separator problem: Branch-and-Cut-and-Price.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Joint routing and scheduling for large-scale deterministic IP networks.

[BibT_eX]

[DOI]

Comput. Commun., 2021

Intent-based policy optimization in SD-WAN.

[BibT_eX]

[DOI]

Proceedings of the SIGCOMM '21: ACM SIGCOMM 2021 Conference, 2021

Towards Large-Scale Deterministic IP Networks.

[BibT_eX]

[DOI]

Proceedings of the IFIP Networking Conference, 2021

Network Slicing with Multi-Topology Routing.

[BibT_eX]

[DOI]

Proceedings of the IFIP Networking Conference, 2021

Approximate solutions for a special pagination problem with 2 symbols per tile.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Networking, Sensing and Control, 2021

Network Slicing for Deterministic Latency.

[BibT_eX]

[DOI]

Paolo Medagliani

Jeremie Leguay

Proceedings of the 17th International Conference on Network and Service Management, 2021

2020

Most vital vertices for the shortest s-t path problem: complexity and Branch-and-Cut algorithm.

[BibT_eX]

[DOI]

Optim. Lett., 2020

Bus Routing Optimization Helps Boston Public Schools Design Better Policies.

[BibT_eX]

[DOI]

INFORMS J. Appl. Anal., 2020

Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut.

[BibT_eX]

[DOI]

Discret. Optim., 2020

A 3.0μW@5fps QQVGA Self-Controlled Wake-Up Imager with On-Chip Motion Detection, Auto-Exposure and Object Recognition.

[BibT_eX]

[DOI]

Proceedings of the IEEE Symposium on VLSI Circuits, 2020

Load Balancing for Deterministic Networks.

[BibT_eX]

[DOI]

Proceedings of the 2020 IFIP Networking Conference, 2020

Exact and Heuristic Solutions to the Connected k-Partitioning Problem.

[BibT_eX]

[DOI]

Proceedings of the 7th International Conference on Control, 2020

2019

Optimizing schools' start time and bus routes.

[BibT_eX]

[DOI]

Dimitris Bertsimas

Arthur Delarue

Proc. Natl. Acad. Sci. USA, 2019

Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications.

[BibT_eX]

[DOI]

Dimitris Bertsimas

Patrick Jaillet

Oper. Res., 2019

Travel Time Estimation in the Age of Big Data.

[BibT_eX]

[DOI]

Oper. Res., 2019

The maximum clique interdiction problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

The vertex k-cut problem.

[BibT_eX]

[DOI]

Discret. Optim., 2019

The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Optimal Explanations of Linear Models.

[BibT_eX]

[DOI]

CoRR, 2019

The Price of Interpretability.

[BibT_eX]

[DOI]

CoRR, 2019

Routing and Slot Allocation in 5G Hard Slicing.

[BibT_eX]

[DOI]

Proceedings of the 9th International Network Optimization Conference, 2019

Hard-isolation for Network Slicing.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2019, 2019

2018

Local error analysis for the Stokes equations with a punctual source term.

[BibT_eX]

[DOI]

Numerische Mathematik, 2018

On the m-clique free interval subgraphs polytope: polyhedral analysis and applications.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

ILP Models and Column Generation for the Minimum Sum Coloring Problem.

[BibT_eX]

[DOI]

Fabio Furini

Enrico Malaguti

Ian-Christopher Ternier

Electron. Notes Discret. Math., 2018

Tire Noise Optimization Problem: a Mixed Integer Linear Program Approach.

[BibT_eX]

[DOI]

CoRR, 2018

Algorithms for the bin packing problem with overlapping items.

[BibT_eX]

[DOI]

Aristide Grange

Comput. Ind. Eng., 2018

BE-GOOD: open data for a smarter society.

[BibT_eX]

[DOI]

Samuel Renault

Proceedings of the 11th International Conference on Theory and Practice of Electronic Governance, 2018

A 5 Million Frames Per Second 3D Stacked Image Sensor With In-Pixel Digital Storage.

[BibT_eX]

[DOI]

Proceedings of the 44th IEEE European Solid State Circuits Conference, 2018

2017

A 128x128, 34μm pitch, 8.9mW, 190mK NETD, TECless Uncooled IR bolometer image sensor with column-wise processing.

[BibT_eX]

[DOI]

Proceedings of the Image Sensors and Imaging Systems 2017, 2017

Open Data Ecosystems - Introducing the Stimulator Function.

[BibT_eX]

[DOI]

Samuel Renault

Proceedings of the Electronic Government and the Information Systems Perspective, 2017

Bipartite complete matching vertex interdiction problem with incompatibility constraints: Complexity and heuristics.

[BibT_eX]

[DOI]

Proceedings of the 4th International Conference on Control, 2017

Mathematical formulation for open shop scheduling problem.

[BibT_eX]

[DOI]

Proceedings of the 4th International Conference on Control, 2017

2016

Algorithms for the Pagination Problem, a Bin Packing with Overlapping Items.

[BibT_eX]

[DOI]

Aristide Grange

CoRR, 2016

Optimization of tire noise by solving an Integer Linear Program (ILP).

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE International Conference on Systems, Man, and Cybernetics, 2016

The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

The multi-terminal vertex separator problem: Extended formulations and Branch-and-Cut-and-Price.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Control, 2016

Valid inequalities for unrelated parallel machines scheduling with precedence constraints.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Control, 2016

2014

How Open Data Are Turned into Services?

[BibT_eX]

[DOI]

Muriel Foulonneau

Proceedings of the Exploring Services Science - 5th International Conference, 2014

Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Control, 2014

Mathematical formulations for the Balanced Vertex k-Separator Problem.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Control, 2014

Unrelated parallel machines with precedence constraints: application to cloud computing.

[BibT_eX]

[DOI]

Proceedings of the 3rd IEEE International Conference on Cloud Networking, 2014

2013

1-5 Stars: Metadata on the Openness Level of Open Data Sets in Europe.

[BibT_eX]

[DOI]

Muriel Foulonneau

Proceedings of the Metadata and Semantics Research - 7th Research Conference, 2013

2012

On the NP-completeness of the perfect matching free subgraph problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Rigorous Derivation of the Thin Film Approximation with Roughness-Induced Correctors.

[BibT_eX]

[DOI]

Laurent Chupin

SIAM J. Math. Anal., 2012

Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem.

[BibT_eX]

[DOI]

Mathieu Lacroix

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

A low-noise 15-μm pixel-pitch 640×512 hybrid InGaAs image sensor for night vision.

[BibT_eX]

[DOI]

Michaël Tchagaspanian

Anne Rouvié

Philippe Bois

Proceedings of the Sensors, 2012

2011

Prosper: image and robot-guided prostate brachytherapy

[BibT_eX]

[DOI]

CoRR, 2011

Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems.

[BibT_eX]

[DOI]

Mathieu Lacroix

Comput. Ind. Eng., 2011

2010

Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets.

[BibT_eX]

[DOI]

Mathieu Lacroix

Electron. Notes Discret. Math., 2010

MR prior based automatic segmentation of the prostate in TRUS images for MR/TRUS data fusion.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE International Symposium on Biomedical Imaging: From Nano to Macro, 2010

2008

Utilisation d'atlas anatomiques et de modèles déformables pour la segmentation de la prostate en IRM. (Segmentation of Prostate MRI using Probabilistic Atlas and Deformable Model).

[BibT_eX]

[DOI]

PhD thesis, 2008

Atlas-based prostate segmentation using an hybrid registration.

[BibT_eX]

[DOI]