The following pages link to Jean-Philippe Vial (Q181239):
Displayed 50 items.
- Item:Q181239 (redirect page) (← links)
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem (Q434153) (← links)
- Item:Q181239 (redirect page) (← links)
- Using central prices in the decomposition of linear programs (Q684317) (← links)
- Item:Q181239 (redirect page) (← links)
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm (Q688920) (← links)
- A restricted trust region algorithm for unconstrained optimization (Q761253) (← links)
- Item:Q181239 (redirect page) (← links)
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation (Q853887) (← links)
- Automatic formulation of stochastic programs via an algebraic modeling language (Q871689) (← links)
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems (Q1016355) (← links)
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems: a corrigendum (Q1016357) (← links)
- A polynomial Newton method for linear programming (Q1094330) (← links)
- A fully polynomial time projective method (Q1104857) (← links)
- Cutting planes and column generation techniques with the projective algorithm (Q1123123) (← links)
- Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon (Q1132745) (← links)
- Strong convexity of sets and functions (Q1161996) (← links)
- A polynomial method of approximate centers for linear programming (Q1196720) (← links)
- Todd's low-complexity algorithm is a predictor-corrector path-following method (Q1197903) (← links)
- A projective algorithm for linear programming with no regularity condition (Q1200753) (← links)
- On improvements to the analytic center cutting plane method (Q1273420) (← links)
- Using an interior point method for the master problem in a decomposition approach (Q1278995) (← links)
- A two-cut approach in the analytic center cutting plane method (Q1299931) (← links)
- Warm start and \(\varepsilon\)-subgradients in a cutting plane scheme for block-angular linear programs (Q1303776) (← links)
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming (Q1327215) (← links)
- Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204) (← links)
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method (Q1361108) (← links)
- A path-following version of the Todd-Burrell procedure for linear programming (Q1374685) (← links)
- Augmented self-concordant barriers and nonlinear optimization problems with finite complexity (Q1424292) (← links)
- Large-scale convex optimization methods for air quality policy assessment. (Q1428124) (← links)
- Shallow, deep and very deep cuts in the analytic center cutting plane method. (Q1572672) (← links)
- Multiple cuts with a homogeneous analytic center cutting plane method (Q1868387) (← links)
- A practical implementation of stochastic programming: an application to the evaluation of option contracts in supply chains (Q1879584) (← links)
- Primal-dual target-following algorithms for linear programming (Q1915912) (← links)
- A cutting plane method from analytic centers for stochastic programming (Q1922690) (← links)
- An oracle based method to compute a coupled equilibrium in a model of international climate policy (Q2271781) (← links)
- Confidence level solutions for stochastic programming (Q2440765) (← links)
- Step decision rules for multistage stochastic programming: a heuristic approach (Q2440766) (← links)
- Deriving robust counterparts of nonlinear uncertain inequalities (Q2515042) (← links)
- A partitioning algorithm for the network loading problem (Q2654332) (← links)
- Multiple Cuts in the Analytic Center Cutting Plane Method (Q2706328) (← links)
- Robust capacity assignment solutions for telecommunications networks with uncertain demands (Q2811313) (← links)
- Design and Operations of Gas Transmission Networks (Q2892212) (← links)
- Strong and Weak Convexity of Sets and Functions (Q3040937) (← links)
- A Structure-Exploiting Tool in Algebraic Modeling Languages (Q3114643) (← links)
- A Survey of Algorithms for Convex Multicommodity Flow Problems (Q3116724) (← links)
- Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM (Q3391969) (← links)
- (Q3480806) (← links)
- (Q3494376) (← links)
- Lipschitzian Solutions of Perturbed Nonlinear Programming Problems (Q3762092) (← links)