JV
| Title | Published in | Access level | OA Policy | Year | Views | Downloads | |
|---|---|---|---|---|---|---|---|
| ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems | Mathematical Programming |  | 2009 | 402 | 224 | ||
| Automatic Formulation of Stochastic Programs Via an Algebraic Modeling Language | Computational Management Science | | 2007 | 376 | 224 | ||
| Step decision rules for multistage stochastic programming : a heuristic approach | | 2006 | 565 | 1,561 | |||
| An efficient method to compute traffic assignment problems with elastic demands | | 2006 | 582 | 794 | |||
| Oracle-based optimization applied to climate model calibration | Environmental Modeling and Assessment | | 2006 | 358 | 159 | ||
| Solving the p-Median Problem with a Semi-Lagrangian Relaxation | Computational Optimization and Applications | | 2006 | 370 | 336 | ||
| ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems | | 2005 | 514 | 641 | |||
| Proximal-Accpm : a versatile oracle based optimization method | | 2004 | 562 | 601 | |||
| Neatwork, a decision support program for the design of gravity water distribution networks | | 2004 | 502 | 613 | |||
| Automatic formulation and decomposition of stochastic programs via algebraic modeling languages | 2004 | 395 | 0 | ||||
| Semi-Lagrangian Relaxation | | 2004 | 586 | 1,822 | |||
| Oracle-Based optimization applied to climate model calibration | | 2004 | 634 | 603 | |||
| Solving large scale linear multicommodity flow problems with an active set strategy and proximal-accpm | | 2004 | 640 | 851 | |||
| Supplier-Retailer Flexible Commitments Contracts : A Robust Optimization Approach | | 2003 | 759 | 713 | |||
| The Linear Separation Problem Revisited with ACCPM | | 2002 | 497 | 634 | |||
| Proximal ACCPM, a Cutting Plane Method for Column Generation and Lagrangian Relaxation: Application to the P-Median Problem | | 2002 | 651 | 751 | |||
| Multiple Cuts with a Homogeneous Analytic Center Cutting Plane Method | | 2001 | 508 | 599 | |||
| Quantitative analysis of multi-periodic supply chain contracts with options via stochastic programming | | 2001 | 556 | 699 | |||
| Gestion des découpes dans une papeterie | 2000 | 528 | 0 | ||||
| Confidence Level Solutions for Stochastic Programming | | 2000 | 600 | 788 | |||
| Augmented self-concordant barriers and nonlinear optimization problems with finite complexity | | 2000 | 573 | 736 | |||
| Convex nondifferentiable optimization: a survey focussed on the analytic center cutting plane method | 1999 | 472 | 0 | ||||
| A note on the de Ghellinck-Vial infeasible start interior point method | 1999 | 409 | 0 | ||||
| Capacity Planning Under Uncertain Demand in Telecommunications Networks | | 1999 | 709 | 1,605 | |||
| Parallel Implementation of a Central Decomposition Method for Solving Large Scale Planning Problems | 1998 | 470 | 0 | ||||
| A Planning Model with one Million Scenarios Solved on an Affordable Parallel Machine | 1998 | 524 | 0 | ||||
| Mid-Range Planning of Survivable | 1998 | 458 | 0 | ||||
| Homogenous Analytic Center Cutting Plane Methods with Approximate Centers | 1998 | 488 | 0 | ||||
| Multiple Cuts in the Analytic Center Cutting Plane Method | 1998 | 504 | 0 | ||||
| Interior Points Methods for Nondifferentiable Optimization | 1997 | 466 | 0 | ||||
| A Lagrangian Relaxation of the Capacited Multi-Item Lot Sizing Problem Solved with an Interior Point Cutting Plane Algorithm | 1997 | 529 | 0 | ||||
| A Survey of Algorithms for Convex Multicommodity Flow Problems | 1997 | 533 | 0 | ||||
| Structure Exploiting Tool in Algebraic Modeling Languages | 1997 | 535 | 0 | ||||
| Homogenous analytic center cutting plane methods for convex problems and variational inequalities | 1997 | 407 | 0 | ||||
| Solving nonlinear multicommodity flow problems by the analytic center cutting plane method | Mathematical Programming | | 1997 | 381 | 259 | ||
| Advanced Mathematical Programming Modeling to Assess the Benefits from International CO2 Abatement Cooperation | 1997 | 438 | 0 | ||||
| A Two-Cut Approach in the Analytic Center Cutting Plane Method | 1997 | 403 | 0 | ||||
| Warm Start and -Subgradients in Cutting Plane Scheme for Block-Angular Linear Programs | 1997 | 501 | 0 | ||||
| A Generic Path-Following Algorithm with a Sliding Constraint and its Application to Linear Programming and the Computation of Analytic Centers | 1996 | 479 | 0 | ||||
| A Short Note on the Comparative Behaviour of Kelley's Cutting Plane Method and the Analytic Center Cutting Plane Method | 1996 | 491 | 0 | ||||
| Optimal Joint Syntheses of Base and Spare Telecommunication Networks | 1995 | 486 | 0 | ||||
| A Library for Convex Optimization Based on an Analytic Center Cutting Plane Method | 1995 | 493 | 0 | ||||
| Computing Maximum Likelihood Estimators of Convex Density Functions | 1995 | 527 | 0 | ||||
| Using an Interior Point Method for the Master Problem in a Decomposition Approach | 1995 | 447 | 0 | ||||
| Survivability in Telecommunication Networks | 1995 | 475 | 0 |
