Journal papers
Outlier detection in regression: conic quadratic formulations. A. Gómez, JN. INFORMS Journal on Computing (accepted August 2025, to appear)
Weak power domination. J.-F. Dumollard, S. Le Bozec-Chiffoleau, JN. Annals of Operations Research (available online, September 2025)
Solving Combinatorial Pricing Problems Using Embedded Dynamic Programming Models. Q.M. Bui, M. Carvalho, JN. INFORMS Journal on Computing (2025)
Asymmetry in the complexity of the multi-commodity network pricing problem. Q.M. Bui, M. Carvalho, JN. Mathematical Programming (2024)
A solution method for mixed-variable constrained blackbox optimization problems. M.-A. Dahito, L. Genest, A. Maddaloni, JN. Optimization and Engineering (2023)
The no-meet matroid. W. Ben-Ameur, N. Kushik, A. Maddaloni, JN, D. Watel. Discrete Applied Mathematics (2022)
A polyhedral view to a generalization of multiple domination. JN. Discrete Applied Mathematics 313 (2022) 1-17
New bounds for subset selection from conic relaxations. W. Ben-Ameur and JN. European Journal of Operational Research 298 (2022) 425-438
A class of spectral bounds for Max k-cut. M.F. Anjos and JN. Discrete Applied Mathematics 279 (2020) 12-24
Spectral bounds for graph partitioning with prescribed partition sizes. M.F. Anjos and JN. Discrete Applied Mathematics 269 (2019) 200-210
On total f-domination: Polyhedral and algorithmic results. M. Dell'Amico and JN. Discrete Applied Mathematics 258 (2019) 97-104
On fractional cut covers. W. Ben-Ameur and JN. Discrete Applied Mathematics 265 (2019) 168-181
On f-domination: polyhedral and algorithmic results. M. Dell'Amico and JN. Mathematical Methods of Operations Research 90:1 (2019) 1-22
Complete formulations of polytopes related to extensions of assignment matrices. W. Ben-Ameur, A. Glorieux and JN. Discrete Optimization 29 (2018) 133-147
On the most imbalanced orientation of a graph. W. Ben-Ameur, A. Glorieux and JN. Journal of Combinatorial Optimization 36:2 (2018) 637-669
On the diameter of cut polytopes. JN. Discrete Mathematics 339 (2016) 1605-1612
Optimal mapping of Cloud Virtual Machines. G. Wang, W. Ben-Ameur, JN., A. Ouorou. Electronic Notes in Discrete Mathematics 52 (2016) 93-100
The k-separator problem : polyhedra, complexity and approximation results. W. Ben-Ameur, JN. and M. Sidi. Journal of Combinatorial Optimization 29 (2015) 276-307
On the polyhedral structure of uniform cut polytopes. JN. Discrete Applied Mathematics 175 (2014) 62-70
A simple finite cutting plane algorithm for integer programs. JN. Operations Research Letters 40 (2012) 578-580
A gradient-based randomized heuristic for the maximum cut problem. W. Ben-Ameur and JN. International journal of Mathematics in Operational Research 4:3 (2012) 276 – 293
From equipartition to uniform cut polytopes: Extended polyhedral results. JN. Discrete Mathematics 311 (2011) 705-714
A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems. W. Ben-Ameur and JN. Discrete Applied Mathematics 159 (2011) 1689-1698
Spectral bounds for (-1,1)-unconstrained quadratic problems with applications to the maximum-cut problem. W. Ben-Ameur and JN. European Journal of Operational Research 207 (2010) 15-24
A geometric characterization of "optimality-equivalent" relaxations. W. Ben-Ameur and JN. Journal of Global Optimization 42:4 (2008) 533-547
Spectral bounds for the maximum cut problem. W. Ben-Ameur and JN. Networks 52:1 (2008) 8-13
Acceleration of cutting-plane and column generation algorithms: Applications to network design. W. Ben-Ameur and JN. Networks 49:1 (2007) 3-17
A constraint generation algorithm for large-scale linear programs using multiple-points separation. W. Ben-Ameur and JN. Mathematical Programming 107:3 (2006) 517-537
Book chapters
The Maximum Cut Problem. W. Ben-Ameur, R. Mahjoub and JN. In " Paradigms of Combinatorial Optimization: Pt. 2", V. Paschos, ISTE Ltd and John Wiley & Sons Inc., 131-172 (2010)
Le problème de coupe maximum. W. Ben-Ameur, R. Mahjoub and JN. In "Optimisation Combinatoire 4", V. Paschos, Hermès, 17-59, (2006)
Conference proceedings
Neuron Pairs in Binarized Neural Networks Robustness Verification via Integer Linear Programming.
D. Lubczyk and JN. LNCS, Proceedings of ISCO 2024, Spain (2024) 305-317
On the performance of the OrthoMads algorithm on continuous and mixed-integer optimization problems. M-A. Dahito, L. Genest, A. Maddaloni and JN. Proceedings of International Conference on Optimization, Learning Algorithms and Applications (OL2A 2021). Communications in Computer and Information Science vol 1488. Springer (2021) 31-47
A polyhedral view to generalized multiple domination and limited packing. JN. LNCS 10856, Proceedings of ISCO 2018, Morocco (2018) 352-363
From graph orientation to the unweighted maximum cut. W. Ben-Ameur, A. Glorieux and JN. Computing and Combinatorics, LNCS 9797. COCOON 2016, Vietnam (2016) 370-384
A full description of polytopes related to the index of the lowest nonzero row of an assignment matrix. W. Ben-Ameur, A. Glorieux and JN. LNCS, ISCO 2016, Italy (2016) 13-25
On the most imbalanced orientation of a graph. W. Ben-Ameur, A. Glorieux and JN. COCOON 2015, China (2015) 16-29
Optimal mapping of cloud virtual machines. W. Ben-Ameur, JN., A. Ouorou, G. Wang. INOC 2015, Poland (2015)
The k-Separator Problem. W. Ben-Ameur, M.-A. Mohamed-Sidi and JN. Computing and Combinatorics. LNCS 7936, COCOON 2013, China (2013) 337-348
Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems. A. Bley and JN., IPCO 2010, Switzerland (2010) 205-218
A Polynomial-Time Recursive Algorithm for some Unconstrained Quadratic Optimization Problems. W. Ben-Ameur and JN. CTW 2009, France (2009) 105-108
Spectral Bounds for the maximum cut problem. W. Ben-Ameur and JN. INOC 2007, Belgium (2007)