José Neto

28 papers B 1C 2Misc 3Journal 21Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Weak power domination.
Ann. Oper. Res.
Jean-François Dumollard, Sulian Le Bozec-Chiffoleau, José Neto
2024 J jnl
Asymmetry in the complexity of the multi-commodity network pricing problem.
Math. Program.
Quang Minh Bui, Margarida Carvalho, José Neto
2024 J jnl
Solving Combinatorial Pricing Problems using Embedded Dynamic Programming Models.
CoRR
Quang Minh Bui, Margarida Carvalho, José Neto
2024 J jnl
The no-meet matroid.
Discret. Appl. Math.
Walid Ben-Ameur, Natalia Kushik, Alessandro Maddaloni, José Neto, Dimitri Watel
2022 J jnl
A polyhedral view to a generalization of multiple domination.
Discret. Appl. Math.
José Neto
2022 J jnl
New bounds for subset selection from conic relaxations.
Eur. J. Oper. Res.
Walid Ben-Ameur, José Neto
2021 — conf
On the Performance of the ORTHOMADS Algorithm on Continuous and Mixed-Integer Optimization Problems.
OL2A
Marie-Ange Dahito, Laurent Genest, Alessandro Maddaloni, José Neto
2020 J jnl
A class of spectral bounds for Max k-Cut.
Discret. Appl. Math.
Miguel F. Anjos, José Neto
2019 J jnl
On
Math. Methods Oper. Res.
Mauro Dell'Amico, José Neto
2019 J jnl
On fractional cut covers.
Discret. Appl. Math.
José Neto, Walid Ben-Ameur
2019 J jnl
On total f-domination: Polyhedral and algorithmic results.
Discret. Appl. Math.
Mauro Dell'Amico, José Neto
2019 J jnl
Spectral bounds for graph partitioning with prescribed partition sizes.
Discret. Appl. Math.
Miguel F. Anjos, José Neto
2018 C conf
A Polyhedral View to Generalized Multiple Domination and Limited Packing.
ISCO
José Neto
2018 J jnl
Complete formulations of polytopes related to extensions of assignment matrices.
Discret. Optim.
Walid Ben-Ameur, Antoine Glorieux, José Neto
2018 J jnl
On the most imbalanced orientation of a graph.
J. Comb. Optim.
Walid Ben-Ameur, Antoine Glorieux, José Neto
2016 C conf
A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix.
ISCO
Walid Ben-Ameur, Antoine Glorieux, José Neto
2016 Misc conf
From Graph Orientation to the Unweighted Maximum Cut.
COCOON
Walid Ben-Ameur, Antoine Glorieux, José Neto
2016 J jnl
Optimal Mapping of Cloud Virtual Machines.
Electron. Notes Discret. Math.
Guanglei Wang, Walid Ben-Ameur, José Neto, Adam Ouorou
2015 Misc conf
On the Most Imbalanced Orientation of a Graph.
COCOON
Walid Ben-Ameur, Antoine Glorieux, José Neto
2015 J jnl
The $$k$$ k -separator problem: polyhedra, complexity and approximation results.
J. Comb. Optim.
Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, José Neto
2014 J jnl
On the polyhedral structure of uniform cut polytopes.
Discret. Appl. Math.
José Neto
2013 Misc conf
The
COCOON
Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, José Neto
2012 J jnl
A gradient-based randomised heuristic for the maximum cut problem.
Int. J. Math. Oper. Res.
Walid Ben-Ameur, José Neto
2012 J jnl
A simple finite cutting plane algorithm for integer programs.
Oper. Res. Lett.
José Neto
2011 J jnl
A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems.
Discret. Appl. Math.
Walid Ben-Ameur, José Neto
2011 J jnl
From equipartition to uniform cut polytopes: Extended polyhedral results.
Discret. Math.
José Neto
2010 B conf
Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems.
IPCO
Andreas Bley, José Neto
2010 J jnl
Spectral bounds for unconstrained (-1, 1)-quadratic optimization problems.
Eur. J. Oper. Res.
Walid Ben-Ameur, José Neto