| Publication | Date of Publication | Type |
|---|
On the generation of metric TSP instances with a large integrality gap by branch-and-cut
Mathematical Programming Computation | 2023-07-24 | Paper |
The Fourier discrepancy function
Communications in Mathematical Sciences | 2023-07-17 | Paper |
A kinetic description of the body size distribution of species
M\(^3\)AS. Mathematical Models & Methods in Applied Sciences | 2023-06-22 | Paper |
| Primal heuristics for Wasserstein barycenters | 2022-12-21 | Paper |
A SAT encoding to compute aperiodic tiling rhythmic canons
(available as arXiv preprint) | 2022-08-30 | Paper |
Size distribution of cities: a kinetic explanation
Physica A | 2022-07-26 | Paper |
Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
INFORMS Journal on Computing | 2022-06-30 | Paper |
Total coloring and total matching: polyhedra and facets
European Journal of Operational Research | 2022-06-10 | Paper |
Total Coloring and Total Matching: Polyhedra and Facets
(available as arXiv preprint) | 2021-05-20 | Paper |
The equivalence of Fourier-based and Wasserstein metrics on imaging problems
Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Serie IX. Rendiconti Lincei. Matematica e Applicazioni | 2021-03-23 | Paper |
| The maximum nearby flow problem | 2020-12-15 | Paper |
On the computation of Kantorovich-Wasserstein distances between two-dimensional histograms by uncapacitated minimum cost flows
SIAM Journal on Optimization | 2020-09-17 | Paper |
Human behavior and lognormal distribution. A kinetic description
M\(^3\)AS. Mathematical Models & Methods in Applied Sciences | 2019-11-29 | Paper |
| Computing Wasserstein barycenters via linear programming | 2019-10-14 | Paper |
Handling preferences in student-project allocation
Annals of Operations Research | 2019-03-06 | Paper |
Call center service times are lognormal: a Fokker-Planck description
M\(^3\)AS. Mathematical Models & Methods in Applied Sciences | 2018-10-26 | Paper |
| On the separation of topology-free rank inequalities for the max stable set problem | 2018-08-13 | Paper |
A Lagrangian propagator for artificial neural networks in constraint programming
Constraints | 2017-08-16 | Paper |
The balanced academic curriculum problem revisited
Journal of Heuristics | 2017-04-04 | Paper |
Lower bounding procedure for the asymmetric quadratic traveling salesman problem
European Journal of Operational Research | 2016-10-07 | Paper |
Exact solution of graph coloring problems via constraint programming and column generation
INFORMS Journal on Computing | 2016-06-29 | Paper |
On minimum reload cost cycle cover
Discrete Applied Mathematics | 2015-09-22 | Paper |
Coordinated cutting plane generation via multi-objective separation
Mathematical Programming. Series A. Series B | 2014-02-25 | Paper |
Constraint programming-based column generation
Annals of Operations Research | 2013-08-08 | Paper |
A branch‐and‐price approach to k‐clustering minimum biclique completion problem
International Transactions in Operational Research | 2013-05-23 | Paper |
On minimum reload cost cycle cover
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
A simple branching scheme for vertex coloring problems
Discrete Applied Mathematics | 2012-03-19 | Paper |
On minimum changeover cost arborescences
Experimental Algorithms | 2011-06-10 | Paper |
Solving a resource allocation problem in wireless mesh networks: a comparison between a CP-based and a classical column generation
Networks | 2010-11-24 | Paper |
Computational experience with a SDP-based algorithm for maximum cut with limited unbalance
Networks | 2010-11-24 | Paper |
Enhancing CP-based column generation for integer programs
4OR | 2009-12-02 | Paper |
Constraint programming-based column generation
4OR | 2009-11-25 | Paper |
k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2009-06-03 | Paper |
