default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJérémy Omer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Antoine Legrain
, Jérémy Omer:
A Dedicated Pricing Algorithm to Solve a Large Family of Nurse Scheduling Problems with Branch-and-Price. INFORMS J. Comput. 36(4): 1108-1128 (2024)- [j22]Ayse N. Arslan, Jérémy Omer, Fulin Yan:
KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price. Math. Program. Comput. 16(1): 151-184 (2024) - 2023
- [j21]Marin Bougeret, Jérémy Omer, Michael Poss:
Optimization Problems in Graphs with Locational Uncertainty. INFORMS J. Comput. 35(3): 578-592 (2023) - [j20]Gregory Guernec, Valérie Garès, Jérémy Omer, Philippe Saint-Pierre, Nicolas Savy:
OTrecod: An R Package for Data Fusion using Optimal Transportation Theory. R J. 14(4): 195-222 (2023) - 2022
- [i2]Marin Bougeret, Jérémy Omer, Michael Poss:
Approximating optimization problems in graphs with locational uncertainty. CoRR abs/2206.08187 (2022) - 2021
- [j19]Jérémy Omer, Michael Poss:
Identifying relatively irreducible infeasible subsystems of linear inequalities. Ann. Oper. Res. 304(1): 361-379 (2021) - [j18]Jérémy Omer, Michael Poss:
A polynomial algorithm for minimizing travel time in consistent time-dependent networks with waits. Networks 77(3): 421-434 (2021) - [j17]Jérémy Omer, Antonio Mucherino:
The Referenced Vertex Ordering Problem: Theory, Applications, and Solution Methods. Open J. Math. Optim. 2: 1-29 (2021) - [i1]Marin Bougeret, Jérémy Omer, Michael Poss:
Optimization problems in graphs with locational uncertainty. CoRR abs/2109.00389 (2021) - 2020
- [j16]Jérémy Omer, Tangi Migot:
Vertex order with optimal number of adjacent predecessors. Discret. Math. Theor. Comput. Sci. 22(1) (2020) - [j15]Antoine Legrain, Jérémy Omer, Samuel Rosat:
An online stochastic algorithm for a dynamic nurse scheduling problem. Eur. J. Oper. Res. 285(1): 196-210 (2020) - [j14]Antoine Legrain, Jérémy Omer, Samuel Rosat:
A rotation-based branch-and-price approach for the nurse scheduling problem. Math. Program. Comput. 12(3): 417-450 (2020) - [j13]Jérémy Omer, Douglas Soares Gonçalves:
An integer programming approach for the search of discretization orders in distance geometry problems. Optim. Lett. 14(2): 439-452 (2020) - [j12]Antonio Mucherino, Jérémy Omer, Ludovic Hoyet, Paolo Robuffo Giordano, Franck Multon:
An application-based characterization of dynamical distance geometry problems. Optim. Lett. 14(2): 493-507 (2020)
2010 – 2019
- 2019
- [j11]Jérémy Omer, Michael Poss:
Time-dependent shortest paths with discounted waits. Networks 74(3): 287-301 (2019) - [j10]Mounir Haddou, Tangi Migot, Jérémy Omer:
A generalized direction in interior point method for monotone linear complementarity problems. Optim. Lett. 13(1): 35-53 (2019) - 2017
- [j9]Thibault Lehouillier, Jérémy Omer, François Soumis, Guy Desaulniers:
Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem. Eur. J. Oper. Res. 256(3): 696-712 (2017) - [j8]Thibault Lehouillier, Moncef Ilies Nasri, François Soumis, Guy Desaulniers, Jérémy Omer:
Solving the Air Conflict Resolution Problem Under Uncertainty Using an Iterative Biobjective Mixed Integer Programming Approach. Transp. Sci. 51(4): 1242-1258 (2017) - 2016
- [j7]Thibault Lehouillier, François Soumis, Jérémy Omer, Cyril Allignol:
Measuring the interactions between air traffic control and flow management using a simulation-based framework. Comput. Ind. Eng. 99: 269-279 (2016) - 2015
- [j6]Jérémy Omer:
A space-discretized mixed-integer linear model for air-conflict resolution with speed and heading maneuvers. Comput. Oper. Res. 58: 75-86 (2015) - [j5]Jérémy Omer, Mehdi Towhidi, François Soumis:
The positive edge pricing rule for the dual simplex. Comput. Oper. Res. 61: 135-142 (2015) - [j4]Jérémy Omer, François Soumis:
A linear programming decomposition focusing on the span of the nondegenerate columns. Eur. J. Oper. Res. 245(2): 371-383 (2015) - [j3]Jérémy Omer, Samuel Rosat, Vincent Raymond, François Soumis:
Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis. INFORMS J. Comput. 27(4): 773-787 (2015) - [j2]Jérémy Omer:
Comparison of Mixed-Integer Linear Models for Fuel-Optimal Air Conflict Resolution With Recovery. IEEE Trans. Intell. Transp. Syst. 16(6): 3126-3137 (2015) - [c1]Thibault Lehouillier, Jérémy Omer, François Soumis, Guy Desaulniers:
A New Variant of the Minimum-Weight Maximum-Cardinality Clique Problem to Solve Conflicts between Aircraft. MCO (1) 2015: 3-14 - 2013
- [j1]Jérémy Omer, Jean-Loup Farges:
Hybridization of Nonlinear and Mixed-Integer Linear Programming for Aircraft Separation With Trajectory Recovery. IEEE Trans. Intell. Transp. Syst. 14(3): 1218-1230 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 20:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
