303 results on '"Sébastien Martin"'
Search Results
52. Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications.
53. Travel Time Estimation in the Age of Big Data.
54. The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut.
55. The vertex k-cut problem.
56. Optimizing schools' start time and bus routes.
57. The maximum clique interdiction problem.
58. High Capacity and Resilient Large-Scale Deterministic IP Networks.
59. Constrained shortest path tour problem: Branch-and-Price algorithm.
60. Bipartite complete matching vertex interdiction problem with incompatibility constraints: Complexity and heuristics.
61. Mathematical formulation for open shop scheduling problem.
62. Open Data Ecosystems - Introducing the Stimulator Function.
63. A 128x128, 34μm pitch, 8.9mW, 190mK NETD, TECless Uncooled IR bolometer image sensor with column-wise processing.
64. Expérience d’un médecin assistant dans un cabinet de médecine de famille interprofessionnel
65. A 3.0μW@5fps QQVGA Self-Controlled Wake-Up Imager with On-Chip Motion Detection, Auto-Exposure and Object Recognition.
66. Algorithms for the bin packing problem with overlapping items.
67. Local error analysis for the Stokes equations with a punctual source term.
68. ILP Models and Column Generation for the Minimum Sum Coloring Problem.
69. On the m-clique free interval subgraphs polytope: polyhedral analysis and applications.
70. Joint Routing and Scheduling for Large-Scale Deterministic IP Networks.
71. The multi-terminal vertex separator problem: Extended formulations and Branch-and-Cut-and-Price.
72. Valid inequalities for unrelated parallel machines scheduling with precedence constraints.
73. The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness.
74. Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut.
75. Optimization of tire noise by solving an Integer Linear Program (ILP).
76. Hard-isolation for Network Slicing.
77. The Price of Interpretability.
78. Optimal Explanations of Linear Models.
79. Data Supplement from Selective Release of a Cyclopamine Glucuronide Prodrug toward Stem-like Cancer Cell Inhibition in Glioblastoma
80. Transports
81. An upgradable testing platform designed to characterize and test optical components of FMCW LiDARs, particularly optical phased arrays
82. Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment.
83. Mathematical formulations for the Balanced Vertex k-Separator Problem.
84. How Open Data Are Turned into Services?
85. Unrelated parallel machines with precedence constraints: application to cloud computing.
86. Les collectivités locales, nouveaux soutiens des ambitions nationales de réindustrialisation
87. 1-5 Stars: Metadata on the Openness Level of Open Data Sets in Europe.
88. Evidence-Based Practice: proposal for an extended definition
89. BE-GOOD: open data for a smarter society.
90. Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem.
91. Tire Noise Optimization Problem: a Mixed Integer Linear Program Approach.
92. MR prior based automatic segmentation of the prostate in TRUS images for MR/TRUS data fusion.
93. Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut.
94. Tracking of the mitral valve leaflet in echocardiography images.
95. Fast Segmentation of the Mitral Valve Leaflet in Echocardiography.
96. Bien-être, productivité et emploi : résoudre la quadrature du cercle en matière de temps de travail
97. Rigorous Derivation of the Thin Film Approximation with Roughness-Induced Correctors.
98. On the NP-completeness of the perfect matching free subgraph problem.
99. Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems.
100. Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.