The following pages link to Jean-Philippe P. Richard (Q330265):
Displayed 41 items.
- A class of algorithms for mixed-integer bilevel min-max optimization (Q330266) (← links)
- A column generation-based heuristic algorithm for an inventory routing problem with perishable goods (Q375988) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting (Q429687) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
- An integrated supply chain problem: a nested Lagrangian relaxation approach (Q492808) (← links)
- (Q591383) (redirect page) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- On the extreme inequalities of infinite group problems (Q847827) (← links)
- Cook, Kannan and Schrijver's example revisited (Q955332) (← links)
- Relations between facets of low- and high-dimensional group problems (Q964183) (← links)
- Valid inequalities for mips and group polyhedra from approximate liftings (Q1016121) (← links)
- (Q1424280) (redirect page) (← links)
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms (Q1424281) (← links)
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting (Q1424282) (← links)
- Deriving convex hulls through lifting and projection (Q1646568) (← links)
- (Q1751123) (redirect page) (← links)
- Multi-commodity variable upper bound flow models (Q1751124) (← links)
- Explicit convex and concave envelopes through polyhedral subdivisions (Q1949256) (← links)
- Convexification techniques for linear complementarity constraints (Q2045009) (← links)
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets (Q2248758) (← links)
- On cutting planes for cardinality-constrained linear programs (Q2330656) (← links)
- A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design (Q2393466) (← links)
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets (Q2638385) (← links)
- Lifted Tableaux Inequalities for 0–1 Mixed-Integer Programs: A Computational Study (Q2899134) (← links)
- Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms (Q2901054) (← links)
- Convexification Techniques for Linear Complementarity Constraints (Q3009774) (← links)
- New inequalities for finite and infinite group problems from approximate lifting (Q3539893) (← links)
- The Group-Theoretic Approach in Mixed Integer Programming (Q3565248) (← links)
- (Q4414645) (← links)
- On the polyhedral structure of two‐level lot‐sizing problems with supplier selection (Q4632950) (← links)
- (Q4737525) (← links)
- Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling (Q5129179) (← links)
- Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction (Q5348475) (← links)
- Facets of Two-Dimensional Infinite Group Problems (Q5388075) (← links)
- Sequential-Merge Facets for Two-Dimensional Group Problems (Q5429255) (← links)
- A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications (Q5429269) (← links)
- Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis (Q5870347) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
- Convexification of Permutation-Invariant Sets and an Application to Sparse PCA (Q6326648) (← links)
- Solving sparse separable bilinear programs using lifted bilinear cover inequalities (Q6406562) (← links)