| Publication | Date of Publication | Type |
|---|
| New mixed-integer nonlinear programming formulations for the unit commitment problems with ramping constraints | 2024-12-20 | Paper |
| Bi-dimensional assignment in 5G periodic scheduling | 2024-10-16 | Paper |
| Deep Neural Networks Pruning via the Structured Perspective Regularization | 2024-01-11 | Paper |
| Ellipsoidal classification via semidefinite programming | 2023-06-28 | Paper |
| Bernard Gendron (1966–2022): Un ami et un collègue | 2023-03-21 | Paper |
| Bernard Gendron (1966–2022): friend and colleague | 2023-03-21 | Paper |
| Comparing perspective reformulations for piecewise-convex optimization | 2022-11-28 | Paper |
| A MILP approach to DRAM access worst-case analysis | 2022-06-22 | Paper |
| A multiperiod drayage problem with customer-dependent service periods | 2022-03-07 | Paper |
| Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design | 2022-01-05 | Paper |
| A constraints-aware reweighted feasibility pump approach | 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 | 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 | 2020-04-30 | Paper |
| QPLIB: a library of quadratic programming instances | 2019-12-19 | Paper |
| Bicriteria Data Compression | 2019-11-08 | Paper |
| Strengthening the sequential convex MINLP technique by perspective reformulations | 2019-07-10 | Paper |
| Bicriteria Data Compression: Efficient and Usable | 2019-06-20 | Paper |
| Accelerated multigrid for graph Laplacian operators | 2019-03-20 | Paper |
| Large-scale unit commitment under uncertainty: an updated literature survey | 2019-03-06 | Paper |
| Improving the approximated projected perspective reformulation by dual information | 2019-02-22 | Paper |
| Delay-constrained routing problems: accurate scheduling models and admission control | 2018-07-11 | Paper |
| On the computational efficiency of subgradient methods: a case study with Lagrangian bounds | 2018-02-21 | Paper |
| Incremental Bundle Methods using Upper Models | 2018-02-14 | Paper |
| Dynamic smoothness parameter for fast gradient methods | 2018-02-09 | Paper |
| Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support | 2016-12-15 | Paper |
| Approximated perspective relaxations: a project and lift approach | 2016-04-04 | Paper |
| Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems | 2015-12-04 | Paper |
| A library for continuous convex separable quadratic knapsack problems | 2015-07-28 | Paper |
| Large-scale unit commitment under uncertainty | 2015-06-23 | Paper |
| Delay-constrained shortest paths: approximation algorithms and second-order cone models | 2015-05-11 | Paper |
| Perspective Reformulations of the CTA Problem with L2 Distances | 2014-11-26 | Paper |
| Bicriteria Data Compression: Efficient and Usable | 2014-10-08 | Paper |
| Bundle methods for sum-functions with ``easy components: applications to multicommodity network design | 2014-06-27 | Paper |
| A nonmonotone proximal bundle method with (potentially) continuous step decisions | 2013-12-13 | Paper |
| A stabilized structured Dantzig-Wolfe decomposition method | 2013-08-12 | Paper |
| Beyond canonical dc-optimization: the single reverse polar problem | 2013-02-14 | Paper |
| A storm of feasibility pumps for nonconvex MINLP | 2012-12-19 | Paper |
| A computational study of cost reoptimization for min-cost flow problems | 2012-06-18 | Paper |
| Symmetric and asymmetric parallelization of a cost-decomposition algorithm for multicommodity flow problems | 2012-05-30 | Paper |
| Projected perspective reformulations with applications in design problems | 2012-03-26 | Paper |
| Piecewise-quadratic Approximations in Convex Numerical Optimization | 2012-03-16 | Paper |
| Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE | 2011-06-30 | Paper |
| Static and dynamic routing under disjoint dominant extreme demands | 2011-03-22 | Paper |
| On interval-subgradient and no-good cuts | 2010-12-20 | Paper |
| Approximate optimality conditions and stopping criteria in canonical DC programming | 2010-05-21 | Paper |
| Convergence Analysis of Deflected Conditional Approximate Subgradient Methods | 2010-03-17 | Paper |
| Outer approximation algorithms for canonical DC problems | 2010-03-17 | Paper |
| A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes | 2009-08-14 | Paper |
| Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints | 2009-08-13 | Paper |
| On the choice of explicit stabilizing terms in column generation | 2009-06-23 | Paper |
| 0-1 reformulations of the multicommodity capacitated network design problem | 2009-06-23 | Paper |
| Experiments with a hybrid interior point/combinatorial approach for network flow problems | 2008-01-18 | Paper |
| SDP diagonalizations and perspective cuts for a class of nonseparable MIQP | 2007-08-27 | Paper |
| Prim-based support-graph preconditioners for min-cost flow problems | 2007-08-27 | Paper |
| Perspective cuts for a class of convex 0-1 mixed integer programs | 2006-05-02 | Paper |
| About Lagrangian methods in integer optimization | 2006-03-07 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| New approaches for optimizing over the semimetric polytope | 2005-12-14 | Paper |
| A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems | 2005-03-15 | Paper |
| New Preconditioners for KKT Systems of Network Flow Problems | 2005-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472366 | 2004-08-04 | Paper |
| A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems | 2003-11-06 | Paper |
| Generalized Bundle Methods | 2003-01-05 | Paper |
| Bundle-based relaxation methods for multicommodity capacitated fixed charge network design | 2002-07-30 | Paper |
| Spectral analysis of (sequences of) graph matrices | 2002-04-23 | Paper |
| On a new class of bilevel programming problems and its use for reformulating mixed integer problems | 1999-04-19 | Paper |
| Solving semidefinite quadratic problems within nonsmooth optimization algorithms | 1997-01-15 | Paper |
