Jean-Philippe Vial

Math. Program., 2015

2014

Robust Optimization.

[BibT_eX]

Proceedings of the ICORES 2014, 2014

2013

Distributionally robust workforce scheduling in call centres with uncertain arrival rates.

[BibT_eX]

[DOI]

Shuangqing Liao

Christian van Delft

Optim. Methods Softw., 2013

Robust capacity assignment solutions for telecommunications networks with uncertain demands.

[BibT_eX]

[DOI]

Networks, 2013

2012

Design and Operations of Gas Transmission Networks.

[BibT_eX]

[DOI]

Oper. Res., 2012

Semi-Lagrangian relaxation applied to the uncapacitated facility location problem.

[BibT_eX]

[DOI]

Cesar Beltran-Royo

Antonio Alonso-Ayuso

Comput. Optim. Appl., 2012

2010

A partitioning algorithm for the network loading problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2010

2009

Nondifferentiable Optimization: Cutting Plane Methods.

[BibT_eX]

[DOI]

Samir Elhedhli

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Nondifferentiable Optimization.

[BibT_eX]

[DOI]

Samir Elhedhli

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems: a corrigendum.

[BibT_eX]

[DOI]

Math. Program., 2009

ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems.

[BibT_eX]

[DOI]

Math. Program., 2009

Test Instances for the Multicommodity Flow Problem: An Erratum.

[BibT_eX]

[DOI]

Oper. Res., 2009

2008

An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands.

[BibT_eX]

[DOI]

Transp. Sci., 2008

An oracle based method to compute a coupled equilibrium in a model of international climate policy.

[BibT_eX]

[DOI]

Comput. Manag. Sci., 2008

Step decision rules for multistage stochastic programming: A heuristic approach.

[BibT_eX]

[DOI]

Julien Thénié

Autom., 2008

Confidence level solutions for stochastic programming.

[BibT_eX]

[DOI]

Autom., 2008

2007

Automatic Formulation of Stochastic Programs Via an Algebraic Modeling Language.

[BibT_eX]

[DOI]

Julien Thénié

Christian van Delft

Comput. Manag. Sci., 2007

A model for robust capacity planning for telecommunications networks under demand uncertainty.

[BibT_eX]

[DOI]

Adam Ouorou

Proceedings of the 6th International Workshop on Design and Reliable Communication Networks, 2007

2006

Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM.

[BibT_eX]

[DOI]

Olivier du Merle

Oper. Res., 2006

Solving the <i>p</i> -Median Problem with a Semi-Lagrangian Relaxation.

[BibT_eX]

[DOI]

Cesar Beltran

Claude Tadonki

Comput. Optim. Appl., 2006

2005

Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach.

[BibT_eX]

[DOI]

Manuf. Serv. Oper. Manag., 2005

2004

Augmented self-concordant barriers and nonlinear optimization problems with finite complexity.

[BibT_eX]

[DOI]

Math. Program., 2004

A practical implementation of stochastic programming: an application to the evaluation of option contracts in supply chains.

[BibT_eX]

[DOI]

Christian van Delft

Autom., 2004

Large-scale convex optimization methods for air quality policy assessment.

[BibT_eX]

[DOI]

Autom., 2004

Efficient Algorithm for Linear Pattern Separation.

[BibT_eX]

[DOI]

Claude Tadonki

Proceedings of the Computational Science, 2004

2003

Multiple Cuts with a Homogeneous Analytic Center Cutting Plane Method.

[BibT_eX]

[DOI]

Olivier Péton

Comput. Optim. Appl., 2003

2002

Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2002

2001

Parallel Implementation of a Central Decomposition Method for Solving Large-Scale Planning Problems.

[BibT_eX]

[DOI]

Jacek Gondzio

Robert Sarkissian

Comput. Optim. Appl., 2001

2000

Multiple Cuts in the Analytic Center Cutting Plane Method.

[BibT_eX]

[DOI]

SIAM J. Optim., 2000

Building and Solving Large-Scale Stochastic Programs on an Affordable Distributed Computing System.

[BibT_eX]

[DOI]

Emmanuel Fragnière

Jacek Gondzio

Ann. Oper. Res., 2000

Decomposition and parallel processing techniques for two-time scale controlled Markov chains.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE Conference on Decision and Control, 2000

1999

Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities.

[BibT_eX]

[DOI]

SIAM J. Optim., 1999

Shallow, deep and very deep cuts in the analytic center cutting plane method.

[BibT_eX]

[DOI]

Math. Program., 1999

A two-cut approach in the analytic center cutting plane method.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 1999

Warm Start and ε-Subgradients in a Cutting Plane Scheme for Block-Angular Linear Programs.

[BibT_eX]

[DOI]

J. Gondizo

Comput. Optim. Appl., 1999

1998

Computing Maximum Likelihood Estimators of Convex Density Functions.

[BibT_eX]

[DOI]

Tamás Terlaky

SIAM J. Sci. Comput., 1998

On Improvements to the Analytic Center Cutting Plane Method.

[BibT_eX]

[DOI]

Olivier du Merle

Comput. Optim. Appl., 1998

Theory and algorithms for linear optimization - an interior point approach.

[BibT_eX]

Cornelis Roos

Tamás Terlaky

Wiley-Interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-0-471-95676-1, 1998

1997

A path-following version of the Todd-Burrell procedure for linear programming.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 1997

1996

Solving nonlinear multicommodity flow problems by the analytic center cutting plane method.

[BibT_eX]

[DOI]

Math. Program., 1996

Long-step primal-dual target-following algorithms for linear programming.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 1996

Primal-dual target-following algorithms for linear programming.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1996

1995

A cutting plane method from analytic centers for stochastic programming.

[BibT_eX]

[DOI]

Math. Program., 1995

1994

Short Steps with Karmarkar's Projective Algorithm for Linear Programming.

[BibT_eX]

[DOI]

SIAM J. Optim., 1994

Experimental Behavior of an Interior Point Cutting Plane Algorithm for Convex Programming: An Application to Geometric Programming.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

1993

On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm.

[BibT_eX]

[DOI]

Math. Program., 1993

1992

A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming.

[BibT_eX]

[DOI]

Dick den Hertog

Cornelis Roos

SIAM J. Optim., 1992

A projective algorithm for linear programming with no regularity condition.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1992

Todd's low-complexity algorithm is a predictor-corrector path-following method.

[BibT_eX]

[DOI]

Michael J. Todd

Oper. Res. Lett., 1992

A polynomial method of approximate centers for linear programming.

[BibT_eX]

[DOI]

Kees Roos

Math. Program., 1992

Alternative Approaches to Feasibility in Projective Methods for Linear Programming.

[BibT_eX]

[DOI]

Chris Fraley

INFORMS J. Comput., 1992

1987

An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex.

[BibT_eX]

[DOI]

Guy de Ghellinck

Math. Program., 1987

1986

A Polynomial Newton Method for Linear Programming.

[BibT_eX]

[DOI]

Guy de Ghellinck

Algorithmica, 1986

1983

Strong and Weak Convexity of Sets and Functions.

[BibT_eX]

[DOI]

Math. Oper. Res., 1983

1977

Unconstrained Optimization by Approximation of the Gradient Path.

[BibT_eX]

[DOI]