Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: José Neto
@article{DBLP:journals/corr/abs-2403-12923, author = {Quang Minh Bui and Margarida Carvalho and Jos{\'{e}} Neto}, title = {Solving Combinatorial Pricing Problems using Embedded Dynamic Programming Models}, journal = {CoRR}, volume = {abs/2403.12923}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2403.12923}, doi = {10.48550/ARXIV.2403.12923}, eprinttype = {arXiv}, eprint = {2403.12923}, timestamp = {Thu, 11 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2403-12923.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nfvsdn/SilvaBSFPMSNCSMSIIAMSKFSPFN23, author = {Felipe Sampaio Dantas da Silva and Ayuri Bessa and S{\'{e}}rgio N. Silva and Samuel Ferino and Pablo Paiva and Marcos Medeiros and Lucas Silva and Jos{\'{e}} Neto and Kevin B. Costa and Charles H. F. dos Santos and Douglas Braz Maciel and Lucileide M. D. Da Silva and Anderson Inoue and Roger Immich and Eduardo Aranha and Allan de M. Martins and Vicente Sousa and Uir{\'{a}} Kulesza and Marcelo Fernandes and Marcos Salvador and Guilherme Pupio and Ramon R. Fontes and Augusto Neto}, editor = {Frank H. P. Fitzek and Larry J. Horner and Molka Gharbaoui and Giang Nguyen and Rentao Gu and Tobias Meuser}, title = {Proactive ML-Assisted and Quality-Driven Slice Application Service Management to Keep QoE in 5G Mobile Networks}, booktitle = {{IEEE} Conference on Network Function Virtualization and Software Defined Networks, {NFV-SDN} 2023, Dresden, Germany, November 7-9, 2023}, pages = {182--184}, publisher = {{IEEE}}, year = {2023}, url = {https://doi.org/10.1109/NFV-SDN59219.2023.10329589}, doi = {10.1109/NFV-SDN59219.2023.10329589}, timestamp = {Thu, 14 Dec 2023 08:33:41 +0100}, biburl = {https://dblp.org/rec/conf/nfvsdn/SilvaBSFPMSNCSMSIIAMSKFSPFN23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2307-05975, author = {Andr{\'{e}}s G{\'{o}}mez and Jos{\'{e}} Neto}, title = {Outlier detection in regression: conic quadratic formulations}, journal = {CoRR}, volume = {abs/2307.05975}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2307.05975}, doi = {10.48550/ARXIV.2307.05975}, eprinttype = {arXiv}, eprint = {2307.05975}, timestamp = {Thu, 27 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2307-05975.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Neto22, author = {Jos{\'{e}} Neto}, title = {A polyhedral view to a generalization of multiple domination}, journal = {Discret. Appl. Math.}, volume = {313}, pages = {1--17}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2022.01.011}, doi = {10.1016/J.DAM.2022.01.011}, timestamp = {Wed, 27 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/Neto22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eor/Ben-AmeurN22, author = {Walid Ben{-}Ameur and Jos{\'{e}} Neto}, title = {New bounds for subset selection from conic relaxations}, journal = {Eur. J. Oper. Res.}, volume = {298}, number = {2}, pages = {425--438}, year = {2022}, url = {https://doi.org/10.1016/j.ejor.2021.07.011}, doi = {10.1016/J.EJOR.2021.07.011}, timestamp = {Tue, 08 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eor/Ben-AmeurN22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sibgrapi/NetoAVL22, author = {Jos{\'{e}} Neto and Nicksson Arrais and Tiago Vinuto and Jo{\~{a}}o Lucena}, editor = {Bruno Motta de Carvalho and Luiz Marcos Garcia Gon{\c{c}}alves}, title = {Convolution-Vision Transformer for Automatic Lung Sound Classification}, booktitle = {35th {SIBGRAPI} Conference on Graphics, Patterns and Images, {SIBGRAPI} 2022, Natal, Brazil, October 24-27, 2022}, pages = {97--102}, publisher = {{IEEE}}, year = {2022}, url = {https://doi.org/10.1109/SIBGRAPI55357.2022.9991756}, doi = {10.1109/SIBGRAPI55357.2022.9991756}, timestamp = {Mon, 09 Jan 2023 22:15:09 +0100}, biburl = {https://dblp.org/rec/conf/sibgrapi/NetoAVL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ol2a/DahitoGMN21, author = {Marie{-}Ange Dahito and Laurent Genest and Alessandro Maddaloni and Jos{\'{e}} Neto}, editor = {Ana I. Pereira and Florbela P. Fernandes and Jo{\~{a}}o Paulo Coelho and Jo{\~{a}}o Paulo Teixeira and Maria F. Pacheco and Paulo Alves and Rui Pedro Lopes}, title = {On the Performance of the {ORTHOMADS} Algorithm on Continuous and Mixed-Integer Optimization Problems}, booktitle = {Optimization, Learning Algorithms and Applications - First International Conference, {OL2A} 2021, Bragan{\c{c}}a, Portugal, July 19-21, 2021, Revised Selected Papers}, series = {Communications in Computer and Information Science}, volume = {1488}, pages = {31--47}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-91885-9\_3}, doi = {10.1007/978-3-030-91885-9\_3}, timestamp = {Thu, 26 Jan 2023 15:58:57 +0100}, biburl = {https://dblp.org/rec/conf/ol2a/DahitoGMN21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/AnjosN20, author = {Miguel F. Anjos and Jos{\'{e}} Neto}, title = {A class of spectral bounds for Max k-Cut}, journal = {Discret. Appl. Math.}, volume = {279}, pages = {12--24}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.10.002}, doi = {10.1016/J.DAM.2019.10.002}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/AnjosN20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/hal/Neto19, author = {Jos{\'{e}} Neto}, title = {Some contributions to mathematical programming and combinatorial optimization}, year = {2019}, url = {https://tel.archives-ouvertes.fr/tel-04261549}, timestamp = {Mon, 22 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/hal/Neto19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/DellAmicoN19, author = {Mauro Dell'Amico and Jos{\'{e}} Neto}, title = {On total f-domination: Polyhedral and algorithmic results}, journal = {Discret. Appl. Math.}, volume = {258}, pages = {97--104}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2018.11.021}, doi = {10.1016/J.DAM.2018.11.021}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/DellAmicoN19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/NetoB19, author = {Jos{\'{e}} Neto and Walid Ben{-}Ameur}, title = {On fractional cut covers}, journal = {Discret. Appl. Math.}, volume = {265}, pages = {168--181}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.03.020}, doi = {10.1016/J.DAM.2019.03.020}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/NetoB19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/AnjosN19, author = {Miguel F. Anjos and Jos{\'{e}} Neto}, title = {Spectral bounds for graph partitioning with prescribed partition sizes}, journal = {Discret. Appl. Math.}, volume = {269}, pages = {200--210}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.06.007}, doi = {10.1016/J.DAM.2019.06.007}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/AnjosN19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mmor/DellAmicoN19, author = {Mauro Dell'Amico and Jos{\'{e}} Neto}, title = {On \emph{f}-domination: polyhedral and algorithmic results}, journal = {Math. Methods Oper. Res.}, volume = {90}, number = {1}, pages = {1--22}, year = {2019}, url = {https://doi.org/10.1007/s00186-018-0650-4}, doi = {10.1007/S00186-018-0650-4}, timestamp = {Tue, 03 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mmor/DellAmicoN19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/disopt/Ben-AmeurGN18, author = {Walid Ben{-}Ameur and Antoine Glorieux and Jos{\'{e}} Neto}, title = {Complete formulations of polytopes related to extensions of assignment matrices}, journal = {Discret. Optim.}, volume = {29}, pages = {133--147}, year = {2018}, url = {https://doi.org/10.1016/j.disopt.2018.04.002}, doi = {10.1016/J.DISOPT.2018.04.002}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/disopt/Ben-AmeurGN18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/Ben-AmeurGN18, author = {Walid Ben{-}Ameur and Antoine Glorieux and Jos{\'{e}} Neto}, title = {On the most imbalanced orientation of a graph}, journal = {J. Comb. Optim.}, volume = {36}, number = {2}, pages = {637--669}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0117-1}, doi = {10.1007/S10878-017-0117-1}, timestamp = {Tue, 10 Jul 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/Ben-AmeurGN18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iscopt/Neto18, author = {Jos{\'{e}} Neto}, editor = {Jon Lee and Giovanni Rinaldi and Ali Ridha Mahjoub}, title = {A Polyhedral View to Generalized Multiple Domination and Limited Packing}, booktitle = {Combinatorial Optimization - 5th International Symposium, {ISCO} 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10856}, pages = {352--363}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-319-96151-4\_30}, doi = {10.1007/978-3-319-96151-4\_30}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/iscopt/Neto18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sac/FeioNNA18, author = {Phelipe Dias Feio and Jos{\'{e}} Neto and Vagner de Brito Nascimento and Ant{\^{o}}nio Abel{\'{e}}m}, editor = {Hisham M. Haddad and Roger L. Wainwright and Richard Chbeir}, title = {FI-MApp: a web application for managing {FI-WARE} environments in internet of things}, booktitle = {Proceedings of the 33rd Annual {ACM} Symposium on Applied Computing, {SAC} 2018, Pau, France, April 09-13, 2018}, pages = {791--799}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3167132.3167220}, doi = {10.1145/3167132.3167220}, timestamp = {Thu, 27 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sac/FeioNNA18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Neto16, author = {Jos{\'{e}} Neto}, title = {On the diameter of cut polytopes}, journal = {Discret. Math.}, volume = {339}, number = {5}, pages = {1605--1612}, year = {2016}, url = {https://doi.org/10.1016/j.disc.2016.01.002}, doi = {10.1016/J.DISC.2016.01.002}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Neto16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/WangWJA16, author = {Guanglei Wang and Walid Ben{-}Ameur and Jos{\'{e}} Neto and Adam Ouorou}, title = {Optimal Mapping of Cloud Virtual Machines}, journal = {Electron. Notes Discret. Math.}, volume = {52}, pages = {93--100}, year = {2016}, url = {https://doi.org/10.1016/j.endm.2016.03.013}, doi = {10.1016/J.ENDM.2016.03.013}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/WangWJA16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/Ben-AmeurGN16, author = {Walid Ben{-}Ameur and Antoine Glorieux and Jos{\'{e}} Neto}, editor = {Thang N. Dinh and My T. Thai}, title = {From Graph Orientation to the Unweighted Maximum Cut}, booktitle = {Computing and Combinatorics - 22nd International Conference, {COCOON} 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9797}, pages = {370--384}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-319-42634-1\_30}, doi = {10.1007/978-3-319-42634-1\_30}, timestamp = {Tue, 14 May 2019 10:00:35 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/Ben-AmeurGN16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iscopt/Ben-AmeurGN16, author = {Walid Ben{-}Ameur and Antoine Glorieux and Jos{\'{e}} Neto}, editor = {Raffaele Cerulli and Satoru Fujishige and Ali Ridha Mahjoub}, title = {A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix}, booktitle = {Combinatorial Optimization - 4th International Symposium, {ISCO} 2016, Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9849}, pages = {13--25}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-319-45587-7\_2}, doi = {10.1007/978-3-319-45587-7\_2}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/iscopt/Ben-AmeurGN16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/Ben-AmeurMN15, author = {Walid Ben{-}Ameur and Mohamed{-}Ahmed Mohamed{-}Sidi and Jos{\'{e}} Neto}, title = {The {\textdollar}{\textdollar}k{\textdollar}{\textdollar} k -separator problem: polyhedra, complexity and approximation results}, journal = {J. Comb. Optim.}, volume = {29}, number = {1}, pages = {276--307}, year = {2015}, url = {https://doi.org/10.1007/s10878-014-9753-x}, doi = {10.1007/S10878-014-9753-X}, timestamp = {Thu, 18 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/Ben-AmeurMN15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/Ben-AmeurGN15, author = {Walid Ben{-}Ameur and Antoine Glorieux and Jos{\'{e}} Neto}, editor = {Dachuan Xu and Donglei Du and Ding{-}Zhu Du}, title = {On the Most Imbalanced Orientation of a Graph}, booktitle = {Computing and Combinatorics - 21st International Conference, {COCOON} 2015, Beijing, China, August 4-6, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9198}, pages = {16--29}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-21398-9\_2}, doi = {10.1007/978-3-319-21398-9\_2}, timestamp = {Sun, 25 Oct 2020 22:58:52 +0100}, biburl = {https://dblp.org/rec/conf/cocoon/Ben-AmeurGN15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Neto14, author = {Jos{\'{e}} Neto}, title = {On the polyhedral structure of uniform cut polytopes}, journal = {Discret. Appl. Math.}, volume = {175}, pages = {62--70}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2014.05.032}, doi = {10.1016/J.DAM.2014.05.032}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Neto14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/Ben-AmeurMN13, author = {Walid Ben{-}Ameur and Mohamed{-}Ahmed Mohamed{-}Sidi and Jos{\'{e}} Neto}, editor = {Ding{-}Zhu Du and Guochuan Zhang}, title = {The \emph{k}-Separator Problem}, booktitle = {Computing and Combinatorics, 19th International Conference, {COCOON} 2013, Hangzhou, China, June 21-23, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7936}, pages = {337--348}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-38768-5\_31}, doi = {10.1007/978-3-642-38768-5\_31}, timestamp = {Tue, 14 May 2019 10:00:35 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/Ben-AmeurMN13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijmor/Ben-AmeurN12, author = {Walid Ben{-}Ameur and Jos{\'{e}} Neto}, title = {A gradient-based randomised heuristic for the maximum cut problem}, journal = {Int. J. Math. Oper. Res.}, volume = {4}, number = {3}, pages = {276--293}, year = {2012}, url = {https://doi.org/10.1504/IJMOR.2012.046688}, doi = {10.1504/IJMOR.2012.046688}, timestamp = {Thu, 16 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijmor/Ben-AmeurN12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Neto12, author = {Jos{\'{e}} Neto}, title = {A simple finite cutting plane algorithm for integer programs}, journal = {Oper. Res. Lett.}, volume = {40}, number = {6}, pages = {578--580}, year = {2012}, url = {https://doi.org/10.1016/j.orl.2012.10.003}, doi = {10.1016/J.ORL.2012.10.003}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Neto12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Ben-AmeurN11, author = {Walid Ben{-}Ameur and Jos{\'{e}} Neto}, title = {A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems}, journal = {Discret. Appl. Math.}, volume = {159}, number = {16}, pages = {1689--1698}, year = {2011}, url = {https://doi.org/10.1016/j.dam.2010.08.028}, doi = {10.1016/J.DAM.2010.08.028}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Ben-AmeurN11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Neto11, author = {Jos{\'{e}} Neto}, title = {From equipartition to uniform cut polytopes: Extended polyhedral results}, journal = {Discret. Math.}, volume = {311}, number = {8-9}, pages = {705--714}, year = {2011}, url = {https://doi.org/10.1016/j.disc.2011.01.018}, doi = {10.1016/J.DISC.2011.01.018}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Neto11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eor/Ben-AmeurN10, author = {Walid Ben{-}Ameur and Jos{\'{e}} Neto}, title = {Spectral bounds for unconstrained (-1, 1)-quadratic optimization problems}, journal = {Eur. J. Oper. Res.}, volume = {207}, number = {1}, pages = {15--24}, year = {2010}, url = {https://doi.org/10.1016/j.ejor.2010.02.042}, doi = {10.1016/J.EJOR.2010.02.042}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eor/Ben-AmeurN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colognetwente/Ben-AmeurN09, author = {Walid Ben{-}Ameur and Jos{\'{e}} Neto}, editor = {Sonia Cafieri and Antonio Mucherino and Giacomo Nannicini and Fabien Tarissan and Leo Liberti}, title = {A Polynomial-Time Recursive Algorithm for some Unconstrained Quadratic Optimization Problems}, booktitle = {Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, {CTW} 2009, Paris, France, June 2-4 2009}, pages = {105--108}, year = {2009}, url = {http://www.lix.polytechnique.fr/ctw09/ctw09-proceedings.pdf\#page=117}, timestamp = {Thu, 12 Mar 2020 11:34:41 +0100}, biburl = {https://dblp.org/rec/conf/colognetwente/Ben-AmeurN09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/Ben-AmeurN08, author = {Walid Ben{-}Ameur and Jos{\'{e}} Neto}, title = {A geometric characterization of "optimality-equivalent" relaxations}, journal = {J. Glob. Optim.}, volume = {42}, number = {4}, pages = {533--547}, year = {2008}, url = {https://doi.org/10.1007/s10898-007-9275-5}, doi = {10.1007/S10898-007-9275-5}, timestamp = {Fri, 11 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgo/Ben-AmeurN08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/Ben-AmeurN08, author = {Walid Ben{-}Ameur and Jos{\'{e}} Neto}, title = {Spectral bounds for the maximum cut problem}, journal = {Networks}, volume = {52}, number = {1}, pages = {8--13}, year = {2008}, url = {https://doi.org/10.1002/net.20220}, doi = {10.1002/NET.20220}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/Ben-AmeurN08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/Ben-AmeurN07, author = {Walid Ben{-}Ameur and Jos{\'{e}} Neto}, title = {Acceleration of cutting-plane and column generation algorithms: Applications to network design}, journal = {Networks}, volume = {49}, number = {1}, pages = {3--17}, year = {2007}, url = {https://doi.org/10.1002/net.20137}, doi = {10.1002/NET.20137}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/Ben-AmeurN07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Ben-AmeurN06, author = {Walid Ben{-}Ameur and Jos{\'{e}} Neto}, title = {A constraint generation algorithm for large scale linear programs using multiple-points separation}, journal = {Math. Program.}, volume = {107}, number = {3}, pages = {517--537}, year = {2006}, url = {https://doi.org/10.1007/s10107-005-0694-0}, doi = {10.1007/S10107-005-0694-0}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Ben-AmeurN06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/quatic/NetoLPRB95, author = {Jos{\'{e}} Neto and Alcino Lavrador and Carlos Pinto and Alberto Rocha and Gloria Branco}, editor = {Carlos Campos Morais and Laxmiprasad Varajid{\'{a}}s and Fernando Brito e Abreu and Lu{\'{\i}}s Amaral}, title = {A Qualidade no Desenvolvimento de Software para Telecomunica{\c{c}}{\~{o}}es}, booktitle = {Proceedings of the 2nd International Conference on the Quality of Information and Communications Technology, {QUATIC} 1995, Lisboa, Portugal, December 4-6, 1995}, series = {{CEUR} Workshop Proceedings}, volume = {1471}, pages = {109--122}, publisher = {CEUR-WS.org}, year = {1995}, url = {https://ceur-ws.org/Vol-1471/paper11.pdf}, timestamp = {Fri, 10 Mar 2023 16:22:59 +0100}, biburl = {https://dblp.org/rec/conf/quatic/NetoLPRB95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.