| ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems | Mathematical Programming | | | 2009 | 451 | 354 |
|
| Automatic Formulation of Stochastic Programs Via an Algebraic Modeling Language | Computational Management Science | | | 2007 | 423 | 364 |
|
| Step decision rules for multistage stochastic programming : a heuristic approach | | | | 2006 | 667 | 1,768 |
|
| An efficient method to compute traffic assignment problems with elastic demands | | | | 2006 | 625 | 1,182 |
|
| Oracle-based optimization applied to climate model calibration | Environmental Modeling and Assessment | | | 2006 | 393 | 225 |
|
| Solving the p-Median Problem with a Semi-Lagrangian Relaxation | Computational Optimization and Applications | | | 2006 | 413 | 833 |
|
| ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems | | | | 2005 | 585 | 723 |
|
| Proximal-Accpm : a versatile oracle based optimization method | | | | 2004 | 625 | 684 |
|
| Neatwork, a decision support program for the design of gravity water distribution networks | | | | 2004 | 554 | 742 |
|
| Automatic formulation and decomposition of stochastic programs via algebraic modeling languages | | | | 2004 | 447 | 0 |
|
| Semi-Lagrangian Relaxation | | | | 2004 | 659 | 1,925 |
|
| Oracle-Based optimization applied to climate model calibration | | | | 2004 | 676 | 615 |
|
| Solving large scale linear multicommodity flow problems with an active set strategy and proximal-accpm | | | | 2004 | 721 | 1,292 |
|
| Supplier-Retailer Flexible Commitments Contracts : A Robust Optimization Approach | | | | 2003 | 899 | 978 |
|
| The Linear Separation Problem Revisited with ACCPM | | | | 2002 | 550 | 705 |
|
| Proximal ACCPM, a Cutting Plane Method for Column Generation and Lagrangian Relaxation: Application to the P-Median Problem | | | | 2002 | 710 | 867 |
|
| Multiple Cuts with a Homogeneous Analytic Center Cutting Plane Method | | | | 2001 | 563 | 624 |
|
| Quantitative analysis of multi-periodic supply chain contracts with options via stochastic programming | | | | 2001 | 645 | 1,013 |
|
| Gestion des découpes dans une papeterie | | | | 2000 | 586 | 0 |
|
| Confidence Level Solutions for Stochastic Programming | | | | 2000 | 657 | 1,051 |
|
| Augmented self-concordant barriers and nonlinear optimization problems with finite complexity | | | | 2000 | 677 | 1,061 |
|
| Convex nondifferentiable optimization: a survey focussed on the analytic center cutting plane method | | | | 1999 | 516 | 0 |
|
| A note on the de Ghellinck-Vial infeasible start interior point method | | | | 1999 | 457 | 0 |
|
| Capacity Planning Under Uncertain Demand in Telecommunications Networks | | | | 1999 | 810 | 1,690 |
|
| Parallel Implementation of a Central Decomposition Method for Solving Large Scale Planning Problems | | | | 1998 | 512 | 0 |
|
| A Planning Model with one Million Scenarios Solved on an Affordable Parallel Machine | | | | 1998 | 574 | 0 |
|
| Mid-Range Planning of Survivable | | | | 1998 | 521 | 0 |
|
| Homogenous Analytic Center Cutting Plane Methods with Approximate Centers | | | | 1998 | 546 | 0 |
|
| Multiple Cuts in the Analytic Center Cutting Plane Method | | | | 1998 | 589 | 0 |
|
| Interior Points Methods for Nondifferentiable Optimization | | | | 1997 | 513 | 0 |
|
| A Lagrangian Relaxation of the Capacited Multi-Item Lot Sizing Problem Solved with an Interior Point Cutting Plane Algorithm | | | | 1997 | 579 | 0 |
|
| A Survey of Algorithms for Convex Multicommodity Flow Problems | | | | 1997 | 623 | 0 |
|
| Structure Exploiting Tool in Algebraic Modeling Languages | | | | 1997 | 591 | 0 |
|
| Homogenous analytic center cutting plane methods for convex problems and variational inequalities | | | | 1997 | 460 | 0 |
|
| Solving nonlinear multicommodity flow problems by the analytic center cutting plane method | Mathematical Programming | | | 1997 | 416 | 556 |
|
| Advanced Mathematical Programming Modeling to Assess the Benefits from International CO2 Abatement Cooperation | | | | 1997 | 486 | 0 |
|
| A Two-Cut Approach in the Analytic Center Cutting Plane Method | | | | 1997 | 436 | 0 |
|
| Warm Start and -Subgradients in Cutting Plane Scheme for Block-Angular Linear Programs | | | | 1997 | 543 | 0 |
|
| A Generic Path-Following Algorithm with a Sliding Constraint and its Application to Linear Programming and the Computation of Analytic Centers | | | | 1996 | 526 | 0 |
|
| A Short Note on the Comparative Behaviour of Kelley's Cutting Plane Method and the Analytic Center Cutting Plane Method | | | | 1996 | 526 | 0 |
|
| Optimal Joint Syntheses of Base and Spare Telecommunication Networks | | | | 1995 | 529 | 0 |
|
| A Library for Convex Optimization Based on an Analytic Center Cutting Plane Method | | | | 1995 | 551 | 0 |
|
| Computing Maximum Likelihood Estimators of Convex Density Functions | | | | 1995 | 585 | 0 |
|
| Using an Interior Point Method for the Master Problem in a Decomposition Approach | | | | 1995 | 508 | 0 |
|
| Survivability in Telecommunication Networks | | | | 1995 | 509 | 0 |
|
