José Neto

发表

FI-MApp: a web application for managing FI-WARE environments in internet of things

Antônio Abelém, Phelipe Feio, José Neto, 2018, SAC.

On the most imbalanced orientation of a graph

Walid Ben-Ameur, José Neto, Antoine Glorieux, 2018, J. Comb. Optim..

A Polyhedral View to Generalized Multiple Domination and Limited Packing

José Neto, 2018, ISCO.

On the most imbalanced orientation of a graph

Walid Ben-Ameur, José Neto, Antoine Glorieux, 2015, Journal of Combinatorial Optimization.

Spectral bounds for the maximum cut problem

Walid Ben-Ameur, José Neto, 2008, Networks.

On fractional cut covers

Walid Ben-Ameur, José Neto, José Neto, 2019, Discret. Appl. Math..

A simple finite cutting plane algorithm for integer programs

José Neto, 2012, Oper. Res. Lett..

Spectral bounds for unconstrained (-1, 1)-quadratic optimization problems

Walid Ben-Ameur, José Neto, 2010, Eur. J. Oper. Res..

On the diameter of cut polytopes

José Neto, 2016, Discret. Math..

On total f-domination: Polyhedral and algorithmic results

Mauro Dell'Amico, José Neto, 2019, Discret. Appl. Math..

On the polyhedral structure of uniform cut polytopes

José Neto, José Neto, 2014, Discret. Appl. Math..

A Qualidade no Desenvolvimento de Software para Telecomunicações

José Neto, Carlos Pinto, Alberto Rocha, 1995, QUATIC.

A geometric characterization of “optimality-equivalent” relaxations

Walid Ben-Ameur, José Neto, José Neto, 2008, J. Glob. Optim..

From equipartition to uniform cut polytopes: Extended polyhedral results

José Neto, 2011, Discret. Math..

Complete formulations of polytopes related to extensions of assignment matrices

Walid Ben-Ameur, José Neto, Antoine Glorieux, 2018, Discret. Optim..

A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix

Walid Ben-Ameur, José Neto, Antoine Glorieux, 2016, ISCO.

Acceleration of cutting‐plane and column generation algorithms: Applications to network design

Walid Ben-Ameur, José Neto, José Neto, 2007, Networks.

The k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{document}-separator problem: polyhedra, complexity and ap

Walid Ben-Ameur, José Neto, Mohamed-Ahmed Mohamed-Sidi, 2014, Journal of Combinatorial Optimization.

A class of spectral bounds for Max k-Cut

Miguel F. Anjos, José Neto, 2020, Discret. Appl. Math..

A constraint generation algorithm for large scale linear programs using multiple-points separation

Walid Ben-Ameur, José Neto, W. Ben-Ameur, 2006, Math. Program..

New bounds for subset selection from conic relaxations

Walid Ben-Ameur, José Neto, José Neto, 2021, Eur. J. Oper. Res..