Groupe d’études et de recherche en analyse des décisions

Publications

Programmation mathématique convexe et non convexe

Articles

A Branch-Price-and-Cut algorithm for a production-routing problem with short-lifespan products
et
À paraître dans : Transportation Science, 2018 référence BibTeX
A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
, et
Computers & Operations Research, 50, 141–153, 2014 référence BibTeX
A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
et
Optimization Letters, 8(3), 903–917, 2014 référence BibTeX
On the Weber facility location problem with limited distances and side constraints
, , , et
Optimization Letters, 8(2), 407–424, 2014 référence BibTeX
Improving heuristics for network modularity maximization using an exact algorithm
, et
Discrete Applied Mathematics, 163(1), 65–72, 2014 référence BibTeX
Trajectory-following methods for large-scale degenerate convex quadratic programming
, et
Mathematical Programming, Serie C, 5(2), 113–142, 2013 référence BibTeX
On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
, et
Discrete Applied Mathematics, 161(1-2), 96–106, 2013 référence BibTeX
Subgradient optimization in nonsmooth optimization (including the Soviet Revolution)
Documenta Math., Extra Volume ISMP , 277–290, 2012 référence BibTeX
The squared slacks transformation in nonlinear programming
et
Sultan Qaboos University Journal for Science, 17(1), 22–29, 2012 référence BibTeX
Construction of sparse signal representations with adaptive multiscale orthogonal bases
et
Signal Processing, 92(6), 1446–1457, 2012 référence BibTeX
A primal-dual regularized interior-point method for convex quadratic programs
et
Mathematical Programming Computation, 4(1), 71–107, 2012 référence BibTeX
A two-level interior-point decomposition algorithm for multi-stage stochastic capacity planning and technology acquisition
et
International Journal of Mathematics in Operational Research, 3(3), 280–294, 2011 référence BibTeX
Comment on "Evolutionary method for finding communities in bipartite networks"
et
Physical Review E, 84(5, article), 2011 référence BibTeX
Solving multi-stage stochastic, in-house production and outsourcing planning by two-level decomposition
et
International Journal of Mathematics in Operational Research, 2(2), 129–150, 2010 référence BibTeX
Edge ratio and community structure in networks
, et
Physical Review E, 81(2, article), 14 pages, 2010 référence BibTeX
Loops and multiple edges in modularity maximization of networks
, et
Physical Review E, 81(4, article), 9 pages, 2010 référence BibTeX
Extension of the Weiszfeld procedure to a single facility minisum location model with mixed norms
, et
Mathematical Methods of Operations Research, 70, 269–283, 2009 référence BibTeX
Reformulation Descent Applied to Circle Packing Problems
, et
Computers & Operations Research, 32(9), 2419–2434, 2005 référence BibTeX

Chapitres de livre

Variable neighborhood search methods
et
C. Floudas, P. Pardalos (eds.), Encyclopedia of Optimization (2nd edition), Springer, 3975–3989, 2009 référence BibTeX

Actes de conférence

An exact method for solving the buffer sizing and inspection stations allocations
, , et
Industrial Engineering and Systems Management Proceedings (IESM), Rabat, Maroc, 2013 référence BibTeX
An iterative scheme for valid polynomial inequality generation in binary polynomial programming
, et
Proceedings of the 15th Conference on Integer Programming and Combinatorial Optimization (IPCO XV), 655, 207–222, 2011 référence BibTeX
A generic linear program for an optimal mine production plan
, et
Proceedings of Mine Planning and Equipment Select & Environmental Issues and Waste Management in Energy and Mineral Product, Banff, Canada, 326–334, 2009 référence BibTeX