SAMOVAR - SAMOVAR
Telecom SudParis
9 rue Charles Fourier
91011 EVRY CEDEX

Fax : +33 (0) 1 60 76 20 80

Pr. José NETO

Ma√ģtre de Conf√©rences
SOP

jose.neto[@-Code to remove to avoid SPAM-]telecom-sudparis.eu

Article dans une revue

2024

ref_biblio
Quang Minh Bui, Margarida Carvalho, Jos√© Neto. Asymmetry in the complexity of the multi-commodity network pricing problem. Mathematical Programming, 2024, ⟨10.1007/s10107-023-02043-2⟩. ⟨hal-04437880⟩
Accès au bibtex
https://arxiv.org/pdf/2212.10673 BibTex

2023

ref_biblio
Marie-Ange Dahito, Laurent Genest, Alessandro Maddaloni, Jos√© Neto. A solution method for mixed-variable constrained blackbox optimization problems. Optimization and Engineering, 2023, ⟨10.1007/s11081-023-09874-0⟩. ⟨hal-04438239⟩
Accès au texte intégral et bibtex
https://hal.science/hal-04438239/file/BOA_OptimizationAndEngineering.pdf BibTex

2022

ref_biblio
Walid Ben-Ameur, Natalia Kushik, Alessandro Maddaloni, Jos√© Neto, Dimitri Watel. The no-meet matroid. Discrete Applied Mathematics, 2022, ⟨10.1016/j.dam.2022.12.008⟩. ⟨hal-03955928⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03955928/file/Revision2.pdf BibTex
ref_biblio
Walid Ben-Ameur, Jos√© Neto. New bounds for subset selection from conic relaxations. European Journal of Operational Research, 2022, 298 (2), pp.425-438. ⟨10.1016/j.ejor.2021.07.011⟩. ⟨hal-03557321⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03557321/file/S0377221721006068.pdf BibTex
ref_biblio
Jos√© Neto. A polyhedral view to a generalization of multiple domination. Discrete Applied Mathematics, 2022, 313, pp.1-17. ⟨10.1016/j.dam.2022.01.011⟩. ⟨hal-03579253⟩
Accès au bibtex
BibTex

2020

ref_biblio
Miguel F Anjos, Jos√© Neto. A class of spectral bounds for Max k-Cut. Discrete Applied Mathematics, 2020, 279, pp.12-24. ⟨10.1016/j.dam.2019.10.002⟩. ⟨hal-02379981⟩
Accès au bibtex
BibTex

2019

ref_biblio
Miguel F Anjos, Jos√© Neto. Spectral bounds for graph partitioning with prescribed partition sizes. Discrete Applied Mathematics, 2019, 269, pp.200-210. ⟨10.1016/j.dam.2019.06.007⟩. ⟨hal-02193294⟩
Accès au texte intégral et bibtex
https://hal.science/hal-02193294/file/S0166218X19302884.pdf BibTex
ref_biblio
Mauro Dell'Amico, Jos√© Neto. On total f-domination: polyhedral and algorithmic results. Discrete Applied Mathematics, 2019, 258, pp.97 - 104. ⟨10.1016/j.dam.2018.11.021⟩. ⟨hal-01975659⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01975659/file/S0166218X18306309.pdf BibTex
ref_biblio
Mauro Dell'Amico, Jos√© Neto. On f-domination: polyhedral and algorithmic results. Mathematical Methods of Operations Research, 2019, 90 (1), pp.1 - 22. ⟨10.1007/s00186-018-0650-4⟩. ⟨hal-01911161⟩
Accès au bibtex
BibTex
ref_biblio
Jos√© Neto, Walid Ben-Ameur. On fractional cut covers. Discrete Applied Mathematics, 2019, 265, pp.168 - 181. ⟨10.1016/j.dam.2019.03.020⟩. ⟨hal-02125083⟩
Accès au texte intégral et bibtex
https://hal.science/hal-02125083/file/S0166218X19301945.pdf BibTex

2018

ref_biblio
Walid Ben-Ameur, Antoine Glorieux, Jos√© Neto. Complete formulations of polytopes related to extensions of assignment matrices. Discrete Optimization, 2018, 29, pp.133 - 147. ⟨10.1016/j.disopt.2018.04.002⟩. ⟨hal-01824469⟩
Accès au bibtex
BibTex
ref_biblio
Walid Ben-Ameur, Antoine Glorieux, Jos√© Neto. On the most imbalanced orientation of a graph. Journal of Combinatorial Optimization, 2018, 36 (2), pp.637-669. ⟨10.1007/s10878-017-0117-1⟩. ⟨hal-01497902⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01497902/file/on_the_most_imbalanced_orientation_of_a_graph_v3.pdf BibTex

2016

ref_biblio
Jos√© Neto. On the diameter of cut polytopes. Discrete Mathematics, 2016, 339 (5), pp.1605 - 1612. ⟨10.1016/j.disc.2016.01.002⟩. ⟨hal-01272340⟩
Accès au bibtex
BibTex
ref_biblio
Guanglei Wang, Walid Ben-Ameur, Jos√© Neto, Adam Ouorou. Optimal mapping of cloud virtual machines. Electronic Notes in Discrete Mathematics, 2016, 52, pp.93 - 100. ⟨10.1016/j.endm.2016.03.013⟩. ⟨hal-01453255⟩
Accès au bibtex
BibTex

2015

ref_biblio
Walid Ben-Ameur, Mohamed Ahmed Mohamed Sidi, Jos√© Neto. The k-separator problem : polyhedra, complexity and approximation results. Journal of Combinatorial Optimization, 2015, 29 (1), pp.276 - 307. ⟨10.1007/s10878-014-9753-x⟩. ⟨hal-01262822⟩
Accès au bibtex
BibTex

2014

ref_biblio
Jos√© Neto. On the polyhedral structure of uniform cut polytopes. Discrete Applied Mathematics, 2014, 175, pp.62 - 70. ⟨10.1016/j.dam.2014.05.032⟩. ⟨hal-01263379⟩
Accès au bibtex
BibTex

2012

ref_biblio
Walid Ben-Ameur, Jos√© Neto. A gradient-based randomised heuristic for the maximum cut problem. International Journal of Mathematics in Operational Research, 2012, 4 (3), pp.276-293. ⟨10.1504/12.46688⟩. ⟨hal-00702709⟩
Accès au bibtex
BibTex
ref_biblio
Jos√© Neto. A simple finite cutting plane algorithm for integer programs. Operations Research Letters, 2012, 40, pp.578-580. ⟨10.1016/j.orl.2012.10.003⟩. ⟨hal-00795146⟩
Accès au bibtex
BibTex

2011

ref_biblio
Walid Ben-Ameur, Jos√© Neto. A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems. Discrete Applied Mathematics, 2011, 159 (16), pp.1689-1698. ⟨10.1016/j.dam.2010.08.028⟩. ⟨hal-00679017⟩
Accès au bibtex
BibTex
ref_biblio
Jos√© Neto. From equipartition to uniform cut polytopes : extended polyhedral results. Discrete Mathematics, 2011, 311 (8 & 9), pp.705-714. ⟨10.1016/j.disc.2011.01.018⟩. ⟨hal-00633526⟩
Accès au bibtex
BibTex

2010

ref_biblio
Walid Ben-Ameur, Jos√© Neto. Spectral bounds for unconstrained (‚ąí1,1)-quadratic optimization problems. European Journal of Operational Research, 2010, 207 (1), pp.15-24. ⟨10.1016/j.ejor.2010.02.042⟩. ⟨hal-00565883⟩
Accès au bibtex
BibTex

2008

ref_biblio
Walid Ben-Ameur, Jos√© Neto. A geometric characterization of "optimality-equivalent" relaxations. Journal of Global Optimization, 2008, 42 (4), pp.533 - 547. ⟨10.1007/s10898-007-9275-5⟩. ⟨hal-01372395⟩
Accès au bibtex
BibTex
ref_biblio
Walid Ben-Ameur, Jos√© Neto. Spectral bounds for the maximum cut problem. Networks, 2008, 52 (1), pp.8 - 13. ⟨10.1002/net.20220⟩. ⟨hal-01326524⟩
Accès au bibtex
BibTex

Communication dans un congrès

2021

ref_biblio
Marie-Ange Dahito, Laurent Genest, Jos√© Neto, Alessandro Maddaloni. On the¬†performance of¬†the¬†ORTHOMADS algorithm on¬†continuous and¬†mixed-integer optimization problems. OL2A 2021: 1st international conference on Optimization, Learning Algorithms and Applications, Jul 2021, Bragan√ßa, Portugal. pp.31-47, ⟨10.1007/978-3-030-91885-9_3⟩. ⟨hal-03589763⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03589763/file/Springer_Lecture_Notes_in_Computer_Science.pdf BibTex

2018

ref_biblio
Jos√© Neto. A polyhedral view to generalized multiple domination and limited packing. ISCO 2018 : International Symposium on Combinatorial Optimization, Apr 2018, Marrakesh, Morocco. pp.352 - 363, ⟨10.1007/978-3-319-96151-4_30⟩. ⟨hal-01849679⟩
Accès au bibtex
BibTex

2016

ref_biblio
Walid Ben-Ameur, Antoine Glorieux, Jos√© Neto. From graph orientation to the unweighted maximum cut. COCOON 2016 : 22nd International Conference on Computing and Combinatorics, Aug 2016, Ho Chi Minh Ville, Vietnam. pp.370-384, ⟨10.1007/978-3-319-42634-1_30⟩. ⟨hal-01497887⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01497887/file/from_graph_orientation_to_the_unweighted_maximum%20cut_problem_v2.pdf BibTex
ref_biblio
Walid Ben-Ameur, Antoine Glorieux, Jos√© Neto. A full description of polytopes related to the index of the lowest nonzero row of an assignment matrix. ISCO 2016 : 4th International Symposium on Combinatorial Optimization, May 2016, Vietri Sul Mare, Italy. pp.13-25, ⟨10.1007/978-3-319-45587-7_2⟩. ⟨hal-01497880⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01497880/file/polyhedral_study-v4.pdf BibTex

2015

ref_biblio
Walid Ben-Ameur, Antoine Glorieux, Jos√© Neto. On the most imbalanced orientation of a graph. COCOON 2015 : 21st International Conference on Computing and Combinatorics, Aug 2015, Beijing, China. pp.16 - 29, ⟨10.1007/978-3-319-21398-9_2⟩. ⟨hal-01497825⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01497825/file/on_the_most_imbalanced_orientation_of_a_graph.pdf BibTex

2013

ref_biblio
Walid Ben-Ameur, Mohamed Ahmed Mohamed Sidi, Jos√© Neto. The k-separator problem. COCOON '13 : 19th International Computing & Combinatorics Conference, Jun 2013, Hangzhou, China. pp.337-348, ⟨10.1007/978-3-642-38768-5_31⟩. ⟨hal-00843860⟩
Accès au bibtex
BibTex

2010

ref_biblio
Andreas Bley, Jos√© Neto. Approximability of 3- and 4-hop bounded disjoint paths problems. IPCO 2010 : 14th Conference on Integer Programming and Combinatorial Optimization, Jun 2010, Lausanne, Switzerland. pp.205 - 218, ⟨10.1007/978-3-642-13036-6_16⟩. ⟨hal-01306851⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01306851/file/Report-024-2009.pdf BibTex

2009

ref_biblio
Walid Ben-Ameur, Jos√© Neto. A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems. CTW 2009 : 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Jun 2009, Paris, France. pp.105 - 108. ⟨hal-01368385⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01368385/file/ctw09-proceedings-1.pdf BibTex

Chapitre d'ouvrage

2010

ref_biblio
Walid Ben-Ameur, Ali Ridha Mahjoub, Jos√© Neto. The maximum cut problem. Paradigms of combinatorial optimization : problems and new approaches, volume 2, Iste; Wiley, pp.131 - 172, 2010, 978-1-84821-148-3. ⟨10.1002/9781118600207.ch6⟩. ⟨hal-01314806⟩
Accès au bibtex
BibTex

HDR

2019

ref_biblio
Jos√© Neto. Some contributions to mathematical programming and combinatorial optimization. Computer Science [cs]. Universit√© Evry-Val d'Essonne/Universit√© Paris Saclay, 2019. ⟨tel-04261549⟩
Accès au texte intégral et bibtex
https://hal.science/tel-04261549/file/HDR_Neto_hal.pdf BibTex

Rapport

2013

ref_biblio
Jos√© Neto. On the diameter of cut polytopes. [Research Report] D√©pt. R√©seaux et Service Multim√©dia Mobiles (Institut Mines-T√©l√©com-T√©l√©com SudParis); Services r√©partis, Architectures, MOd√©lisation, Validation, Administration des R√©seaux (Institut Mines-T√©l√©com-T√©l√©com SudParis-CNRS). 2013, pp.20. ⟨hal-01335919⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01335919/file/manuscript.pdf BibTex

2009

ref_biblio
Andreas Bley, Jos√© Neto. Approximability of 3- and 4-hop bounded disjoint paths problems. [Research Report] Institut fuer Mathematik - TU Berlin - Fakult√§t II (Technische Universit√§t Berlin); D√©pt. R√©seaux et Service Multim√©dia Mobiles (Institut Mines-T√©l√©com-T√©l√©com SudParis); Services r√©partis, Architectures, MOd√©lisation, Validation, Administration des R√©seaux (Institut Mines-T√©l√©com-T√©l√©com SudParis-CNRS). 2009, pp.10. ⟨hal-01370529⟩
Accès au bibtex
BibTex
ref_biblio
Jos√© Neto. From equipartition to uniform cut polytopes : polyhedral results extended. [Research Report] D√©pt. R√©seaux et Service Multim√©dia Mobiles (Institut Mines-T√©l√©com-T√©l√©com SudParis); Services r√©partis, Architectures, MOd√©lisation, Validation, Administration des R√©seaux (Institut Mines-T√©l√©com-T√©l√©com SudParis-CNRS). 2009, pp.16. ⟨hal-01360041⟩
Accès au bibtex
BibTex