| Publication | Date of Publication | Type |
|---|
New mixed-integer nonlinear programming formulations for the unit commitment problems with ramping constraints
Operations Research | 2024-12-20 | Paper |
| Bi-dimensional assignment in 5G periodic scheduling | 2024-10-16 | Paper |
Deep Neural Networks Pruning via the Structured Perspective Regularization
SIAM Journal on Mathematics of Data Science | 2024-01-11 | Paper |
Ellipsoidal classification via semidefinite programming
Operations Research Letters | 2023-06-28 | Paper |
Bernard Gendron (1966–2022): Un ami et un collègue
INFOR: Information Systems and Operational Research | 2023-03-21 | Paper |
Bernard Gendron (1966–2022): friend and colleague
INFOR: Information Systems and Operational Research | 2023-03-21 | Paper |
| Comparing perspective reformulations for piecewise-convex optimization | 2022-11-28 | Paper |
A MILP approach to DRAM access worst-case analysis
Computers & Operations Research | 2022-06-22 | Paper |
A multiperiod drayage problem with customer-dependent service periods
Computers & Operations Research | 2022-03-07 | Paper |
Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
Discrete Applied Mathematics | 2022-01-05 | Paper |
A constraints-aware reweighted feasibility pump approach
Operations Research Letters | 2021-12-13 | Paper |
| A Lagrangian approach to chance constrained routing with local broadcast | 2021-12-08 | Paper |
| Start-up/shut-down MINLP formulations for the unit commitment with ramp constraints | 2021-12-08 | Paper |
Optimization methods: an applications-oriented primer
Analytics for the Sharing Economy: Mathematics, Engineering and Business Perspectives | 2021-10-05 | Paper |
| Quasi-separable Dantzig-Wolfe reformulations for network design | 2021-02-04 | Paper |
Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs
Mathematics of Operations Research | 2020-04-30 | Paper |
QPLIB: a library of quadratic programming instances
Mathematical Programming Computation | 2019-12-19 | Paper |
Bicriteria data compression
SIAM Journal on Computing | 2019-11-08 | Paper |
Strengthening the sequential convex MINLP technique by perspective reformulations
Optimization Letters | 2019-07-10 | Paper |
Bicriteria data compression
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Accelerated multigrid for graph Laplacian operators
Applied Mathematics and Computation | 2019-03-20 | Paper |
Large-scale unit commitment under uncertainty: an updated literature survey
Annals of Operations Research | 2019-03-06 | Paper |
Improving the approximated projected perspective reformulation by dual information
Operations Research Letters | 2019-02-22 | Paper |
Delay-constrained routing problems: accurate scheduling models and admission control
Computers & Operations Research | 2018-07-11 | Paper |
On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
Mathematical Programming Computation | 2018-02-21 | Paper |
Incremental bundle methods using upper models
SIAM Journal on Optimization | 2018-02-14 | Paper |
Dynamic smoothness parameter for fast gradient methods
Optimization Letters | 2018-02-09 | Paper |
Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
Computational Optimization and Applications | 2016-12-15 | Paper |
Approximated perspective relaxations: a project and lift approach
Computational Optimization and Applications | 2016-04-04 | Paper |
Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems
Calcolo | 2015-12-04 | Paper |
A library for continuous convex separable quadratic knapsack problems
European Journal of Operational Research | 2015-07-28 | Paper |
Large-scale unit commitment under uncertainty
4OR | 2015-06-23 | Paper |
Delay-constrained shortest paths: approximation algorithms and second-order cone models
Journal of Optimization Theory and Applications | 2015-05-11 | Paper |
Perspective reformulations of the CTA problem with \(L_2\) distances
Operations Research | 2014-11-26 | Paper |
Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
Mathematical Programming. Series A. Series B | 2014-06-27 | Paper |
A nonmonotone proximal bundle method with (potentially) continuous step decisions
SIAM Journal on Optimization | 2013-12-13 | Paper |
A stabilized structured Dantzig-Wolfe decomposition method
Mathematical Programming. Series A. Series B | 2013-08-12 | Paper |
Beyond canonical dc-optimization: the single reverse polar problem
Journal of Optimization Theory and Applications | 2013-02-14 | Paper |
A storm of feasibility pumps for nonconvex MINLP
Mathematical Programming. Series A. Series B | 2012-12-19 | Paper |
A computational study of cost reoptimization for min-cost flow problems
INFORMS Journal on Computing | 2012-06-18 | Paper |
Symmetric and asymmetric parallelization of a cost-decomposition algorithm for multicommodity flow problems
INFORMS Journal on Computing | 2012-05-30 | Paper |
Projected perspective reformulations with applications in design problems
Operations Research | 2012-03-26 | Paper |
Piecewise-quadratic approximations in convex numerical optimization
SIAM Journal on Optimization | 2012-03-16 | Paper |
Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
Computers & Operations Research | 2011-06-30 | Paper |
Static and dynamic routing under disjoint dominant extreme demands
Operations Research Letters | 2011-03-22 | Paper |
On interval-subgradient and no-good cuts
Operations Research Letters | 2010-12-20 | Paper |
Approximate optimality conditions and stopping criteria in canonical DC programming
Optimization Methods & Software | 2010-05-21 | Paper |
Convergence analysis of deflected conditional approximate subgradient methods
SIAM Journal on Optimization | 2010-03-17 | Paper |
Outer approximation algorithms for canonical DC problems
Journal of Global Optimization | 2010-03-17 | Paper |
A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
Operations Research Letters | 2009-08-14 | Paper |
Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
Operations Research | 2009-08-13 | Paper |
On the choice of explicit stabilizing terms in column generation
Discrete Applied Mathematics | 2009-06-23 | Paper |
0-1 reformulations of the multicommodity capacitated network design problem
Discrete Applied Mathematics | 2009-06-23 | Paper |
Experiments with a hybrid interior point/combinatorial approach for network flow problems
Optimization Methods & Software | 2008-01-18 | Paper |
SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
Operations Research Letters | 2007-08-27 | Paper |
Prim-based support-graph preconditioners for min-cost flow problems
Computational Optimization and Applications | 2007-08-27 | Paper |
Perspective cuts for a class of convex 0-1 mixed integer programs
Mathematical Programming. Series A. Series B | 2006-05-02 | Paper |
About Lagrangian methods in integer optimization
Annals of Operations Research | 2006-03-07 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
New approaches for optimizing over the semimetric polytope
Mathematical Programming. Series A. Series B | 2005-12-14 | Paper |
A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
Journal of Combinatorial Optimization | 2005-03-15 | Paper |
New Preconditioners for KKT Systems of Network Flow Problems
SIAM Journal on Optimization | 2005-02-23 | Paper |
| scientific article; zbMATH DE number 2080144 (Why is no real title available?) | 2004-08-04 | Paper |
A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
INFORMS Journal on Computing | 2003-11-06 | Paper |
Generalized Bundle Methods
SIAM Journal on Optimization | 2003-01-05 | Paper |
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
Discrete Applied Mathematics | 2002-07-30 | Paper |
Spectral analysis of (sequences of) graph matrices
SIAM Journal on Matrix Analysis and Applications | 2002-04-23 | Paper |
On a new class of bilevel programming problems and its use for reformulating mixed integer problems
European Journal of Operational Research | 1999-04-19 | Paper |
Solving semidefinite quadratic problems within nonsmooth optimization algorithms
Computers & Operations Research | 1997-01-15 | Paper |
