Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems. - Andreas Bley; José Neto 001 (IPCO, 2010)

Spectral bounds for unconstrained (-1, 1)-quadratic optimization problems. - Walid Ben-Ameur; José Neto 001 (Eur. J. Oper. Res., 2010)

A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems. - Walid Ben-Ameur; José Neto 001 (Discret. Appl. Math., 2011)

From equipartition to uniform cut polytopes: Extended polyhedral results. - José Neto 001 (Discret. Math., 2011)

A gradient-based randomised heuristic for the maximum cut problem. - Walid Ben-Ameur; José Neto 001 (Int. J. Math. Oper. Res., 2012)

A simple finite cutting plane algorithm for integer programs. - José Neto 001 (Oper. Res. Lett., 2012)

The k-Separator Problem. - Walid Ben-Ameur; Mohamed-Ahmed Mohamed-Sidi; José Neto 001 (COCOON, 2013)

On the polyhedral structure of uniform cut polytopes. - José Neto 001 (Discret. Appl. Math., 2014)

The $$k$$ k -separator problem: polyhedra, complexity and approximation results. - Walid Ben-Ameur; Mohamed-Ahmed Mohamed-Sidi; José Neto 001 (J. Comb. Optim., 2015)

From Graph Orientation to the Unweighted Maximum Cut. - Walid Ben-Ameur; Antoine Glorieux; José Neto 001 (COCOON, 2016)

A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix. - Walid Ben-Ameur; Antoine Glorieux; José Neto 001 (ISCO, 2016)

Optimal Mapping of Cloud Virtual Machines. - Guanglei Wang; Walid Ben-Ameur; José Neto 001; Adam Ouorou (Electron. Notes Discret. Math., 2016)

A Polyhedral View to Generalized Multiple Domination and Limited Packing. - José Neto 001 (ISCO, 2018)

Complete formulations of polytopes related to extensions of assignment matrices. - Walid Ben-Ameur; Antoine Glorieux; José Neto 001 (Discret. Optim., 2018)

On the most imbalanced orientation of a graph. - Walid Ben-Ameur; Antoine Glorieux; José Neto 001 (J. Comb. Optim., 2018)

Spectral bounds for graph partitioning with prescribed partition sizes. - Miguel F. Anjos; José Neto 001 (Discret. Appl. Math., 2019)

On total f-domination: Polyhedral and algorithmic results. - Mauro Dell'Amico; José Neto 001 (Discret. Appl. Math., 2019)

On fractional cut covers. - José Neto 001; Walid Ben-Ameur (Discret. Appl. Math., 2019)

On f-domination: polyhedral and algorithmic results. - Mauro Dell'Amico; José Neto 001 (Math. Methods Oper. Res., 2019)

A class of spectral bounds for Max k-Cut. - Miguel F. Anjos; José Neto 001 (Discret. Appl. Math., 2020)

On the Performance of the ORTHOMADS Algorithm on Continuous and Mixed-Integer Optimization Problems. - Marie-Ange Dahito; Laurent Genest; Alessandro Maddaloni; José Neto 001 (OL2A, 2021)

A polyhedral view to a generalization of multiple domination. - José Neto 001 (Discret. Appl. Math., 2022)

New bounds for subset selection from conic relaxations. - Walid Ben-Ameur; José Neto 001 (Eur. J. Oper. Res., 2022)

Solving Combinatorial Pricing Problems using Embedded Dynamic Programming Models. - Quang Minh Bui; Margarida Carvalho; José Neto 001 (CoRR, 2024)

The no-meet matroid. - Walid Ben-Ameur; Natalia Kushik; Alessandro Maddaloni; José Neto 001; Dimitri Watel (Discret. Appl. Math., 2024)

Asymmetry in the complexity of the multi-commodity network pricing problem. - Quang Minh Bui; Margarida Carvalho; José Neto 001 (Math. Program., 2024)