Add to ORKGProximal ACCPM is a variant of the analytic center cutting plane method, in which a proximal term is added to the barrier function that defines the center. The present paper gives a detailed presentation of the method and of its implementation. Proximal ACCPM is used to solve the Lagrangian relaxation of the p-median problem on two sets of problem instances. Problems of the same collection are tentatively solved with the classical column generation scheme
This work has like objective to present a description of the analytic to center cutting plane method...
We are concerned in this note with an application of an advanced implementation of Goffin and Vial's...
In this paper, we propose to solve the linear multicommodity flow problem using a partial Lagrangian...
Proximal ACCPM is a variant of the analytic center cutting plane method, in which a proximal term is...
Introduction We are concerned in this note with the Goffin Haurie and Vial's [7] Analytic Cent...
The analytic center cutting plane (ACCPM) methods aims to solve nondifferentiable convex problems. T...
The alternating direction method of multipliers (ADMM) is a benchmark for solving convex programming...
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferenti...
The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p facilities, consid...
The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p facilities, conside...
This paper describes a branch-and-price algorithm for the p-median location problem. The objective i...
We consider a proximal operator given by a quadratic function subject to bound constraints and give ...
Recently Beltran-Royo et.al presented a Semi-Lagrangean relaxation for the classical p-median locati...
Proximal distance algorithms combine the classical penalty method of constrained minimization with d...
International audienceThis paper analyzes the introduction of multiple central cuts in a conic formu...
This work has like objective to present a description of the analytic to center cutting plane method...
We are concerned in this note with an application of an advanced implementation of Goffin and Vial's...
In this paper, we propose to solve the linear multicommodity flow problem using a partial Lagrangian...
Proximal ACCPM is a variant of the analytic center cutting plane method, in which a proximal term is...
Introduction We are concerned in this note with the Goffin Haurie and Vial's [7] Analytic Cent...
The analytic center cutting plane (ACCPM) methods aims to solve nondifferentiable convex problems. T...
The alternating direction method of multipliers (ADMM) is a benchmark for solving convex programming...
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferenti...
The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p facilities, consid...
The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p facilities, conside...
This paper describes a branch-and-price algorithm for the p-median location problem. The objective i...
We consider a proximal operator given by a quadratic function subject to bound constraints and give ...
Recently Beltran-Royo et.al presented a Semi-Lagrangean relaxation for the classical p-median locati...
Proximal distance algorithms combine the classical penalty method of constrained minimization with d...
International audienceThis paper analyzes the introduction of multiple central cuts in a conic formu...
This work has like objective to present a description of the analytic to center cutting plane method...
We are concerned in this note with an application of an advanced implementation of Goffin and Vial's...
In this paper, we propose to solve the linear multicommodity flow problem using a partial Lagrangian...