\n\n![\"BibTex\"](\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_bibtex3.png\" "\\"BibTex\\"")
<\/a>\n<\/dd>\n<\/dl>\nCommunication dans un congr\u00e8s<\/p>\n
2024<\/p>\n
\n- ref_biblio<\/dt>
- Dymitr Lubczyk, Jos\u00e9 Neto. Neuron pairs in\u00a0binarized neural networks robustness verification via\u00a0integer linear programming. 8th International Symposium(ISCO)<\/i>, May 2024, Tenerife (Canary Islands), Spain. pp.305-317, ⟨10.1007\/978-3-031-60924-4_23⟩<\/a>. ⟨hal-04890350⟩<\/a><\/dd>\n
- Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
- \n\n
![\"https:\/\/hal.science\/hal-04890350\/file\/DLJN5.pdf\"](\"https:\/\/haltools.archives-ouvertes.fr\/images\/Haltools_pdf.png\" "\\"https:\/\/hal.science\/hal-04890350\/file\/DLJN5.pdf\\"")
<\/a>\n\n<\/a>\n<\/span><\/dd>\n<\/dl>\n2021<\/p>\n
\n- ref_biblio<\/dt>
- Marie-Ange Dahito, Laurent Genest, Jos\u00e9 Neto, Alessandro Maddaloni. On the\u00a0performance of\u00a0the\u00a0ORTHOMADS algorithm on\u00a0continuous and\u00a0mixed-integer optimization problems. OL2A 2021: 1st international conference on Optimization, Learning Algorithms and Applications<\/i>, Jul 2021, Bragan\u00e7a, Portugal. pp.31-47, ⟨10.1007\/978-3-030-91885-9_3⟩<\/a>. ⟨hal-03589763⟩<\/a><\/dd>\n
- Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
- \n\n<\/a>\n\n<\/a>\n<\/span><\/dd>\n<\/dl>\n
2018<\/p>\n
\n- ref_biblio<\/dt>
- Jos\u00e9 Neto. A polyhedral view to generalized multiple domination and limited packing. ISCO 2018 : International Symposium on Combinatorial Optimization<\/i>, Apr 2018, Marrakesh, Morocco. pp.352 - 363, ⟨10.1007\/978-3-319-96151-4_30⟩<\/a>. ⟨hal-01849679⟩<\/a><\/dd>\n
- Acc\u00e8s au bibtex<\/dt>\n
- \n\n<\/a>\n<\/dd>\n<\/dl>\n
2016<\/p>\n
\n- ref_biblio<\/dt>
- Walid Ben-Ameur, Antoine Glorieux, Jos\u00e9 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<\/i>, May 2016, Vietri Sul Mare, Italy. pp.13-25, ⟨10.1007\/978-3-319-45587-7_2⟩<\/a>. ⟨hal-01497880⟩<\/a><\/dd>\n
- Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
- \n\n<\/a>\n\n<\/a>\n<\/span><\/dd>\n<\/dl>\n
\n- ref_biblio<\/dt>
- Walid Ben-Ameur, Antoine Glorieux, Jos\u00e9 Neto. From graph orientation to the unweighted maximum cut. COCOON 2016 : 22nd International Conference on Computing and Combinatorics<\/i>, Aug 2016, Ho Chi Minh Ville, Vietnam. pp.370-384, ⟨10.1007\/978-3-319-42634-1_30⟩<\/a>. ⟨hal-01497887⟩<\/a><\/dd>\n
- Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
- \n\n<\/a>\n\n<\/a>\n<\/span><\/dd>\n<\/dl>\n
2015<\/p>\n
\n- ref_biblio<\/dt>
- Walid Ben-Ameur, Antoine Glorieux, Jos\u00e9 Neto. On the most imbalanced orientation of a graph. COCOON 2015 : 21st International Conference on Computing and Combinatorics<\/i>, Aug 2015, Beijing, China. pp.16 - 29, ⟨10.1007\/978-3-319-21398-9_2⟩<\/a>. ⟨hal-01497825⟩<\/a><\/dd>\n
- Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n
- \n\n<\/a>\n\n<\/a>\n<\/span><\/dd>\n<\/dl>\n
2013<\/p>\n
\n- ref_biblio<\/dt>
- Walid Ben-Ameur, Mohamed S. A. Mohamed, Jos\u00e9 Neto. The k-separator problem. COCOON '13 : 19th International Computing & Combinatorics Conference<\/i>, Jun 2013, Hangzhou, China. pp.337-348, ⟨10.1007\/978-3-642-38768-5_31⟩<\/a>. ⟨hal-00843860⟩<\/a><\/dd>\n
- Acc\u00e8s au bibtex<\/dt>\n
- \n\n<\/a>\n<\/dd>\n<\/dl>\n
2010<\/p>\n
\n- ref_biblio<\/dt>
- Andreas Bley, Jos\u00e9 Neto. Approximability of 3- and 4-hop bounded disjoint paths problems. IPCO 2010 : 14th Conference on Integer Programming and Combinatorial Optimization<\/i>, Jun 2010, Lausanne, Switzerland. pp.205 - 218, ⟨10.1007\/978-3-642-13036-6_16⟩<\/a>. ⟨hal-01306851⟩<\/a><\/dd>\n
![\"](\"https:\/\/samovar.telecom-sudparis.eu\/wp-content\/uploads\/2022\/07\/Jose-NETO.jpg\")