The following pages link to Jérémy Omer (Q319583):
Displaying 21 items.
- A linear programming decomposition focusing on the span of the nondegenerate columns (Q319585) (← links)
- A space-discretized mixed-integer linear model for air-conflict resolution with speed and heading maneuvers (Q337512) (← links)
- The positive edge pricing rule for the dual simplex (Q337606) (← links)
- A generalized direction in interior point method for monotone linear complementarity problems (Q1733321) (← links)
- Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem (Q1752252) (← links)
- The referenced vertex ordering problem: theory, applications, and solution methods (Q2165588) (← links)
- An integer programming approach for the search of discretization orders in distance geometry problems (Q2174886) (← links)
- An application-based characterization of dynamical distance geometry problems (Q2174892) (← links)
- An online stochastic algorithm for a dynamic nurse scheduling problem (Q2183326) (← links)
- A rotation-based branch-and-price approach for the nurse scheduling problem (Q2220898) (← links)
- Identifying relatively irreducible infeasible subsystems of linear inequalities (Q2241565) (← links)
- Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis (Q2802253) (← links)
- Vertex ordering with optimal number of adjacent predecessors (Q5130732) (← links)
- Time‐dependent shortest paths with discounted waits (Q5241428) (← links)
- A New Variant of the Minimum-Weight Maximum-Cardinality Clique Problem to Solve Conflicts between Aircraft (Q5356963) (← links)
- Regularized Optimal Transport of Covariates and Outcomes in Data Recoding (Q5881087) (← links)
- A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits (Q6087122) (← links)
- Optimization Problems in Graphs with Locational Uncertainty (Q6203503) (← links)
- KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price (Q6548520) (← links)
- A dedicated pricing algorithm to solve a large family of nurse scheduling problems with branch-and-price (Q6598946) (← links)
- Combinatorial robust optimization with decision-dependent information discovery and polyhedral uncertainty (Q6633275) (← links)
