var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2Fs89mweDbKfmfDtvCb&jsonp=1&noBootstrap=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2Fs89mweDbKfmfDtvCb&jsonp=1&noBootstrap=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2Fs89mweDbKfmfDtvCb&jsonp=1&noBootstrap=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
    2. \n
  2. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
    3. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2025\n \n \n (12)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems.\n \n \n \n \n\n\n \n Battista, F.; and Santis, M. D.\n\n\n \n\n\n\n 4OR, 23(1): 65–95. 2025.\n \n\n\n\n
\n\n\n\n \n \n \"DealingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/4or/BattistaS25,\n    author = "Battista, Federico and Santis, Marianna De",\n    title = "Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems",\n    journal = "4OR",\n    volume = "23",\n    number = "1",\n    pages = "65--95",\n    year = "2025",\n    url = "https://doi.org/10.1007/s10288-024-00569-5",\n    doi = "10.1007/S10288-024-00569-5",\n    timestamp = "Fri, 09 May 2025 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/4or/BattistaS25.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Using dual relaxations in multiobjective mixed-integer convex quadratic programming.\n \n \n \n \n\n\n \n Santis, M. D.; Eichfelder, G.; Patria, D.; and Warnow, L.\n\n\n \n\n\n\n J. Glob. Optim., 92(1): 159–186. 2025.\n \n\n\n\n
\n\n\n\n \n \n \"UsingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jgo/SantisEPW25,\n    author = "Santis, Marianna De and Eichfelder, Gabriele and Patria, Daniele and Warnow, Leo",\n    title = "Using dual relaxations in multiobjective mixed-integer convex quadratic programming",\n    journal = "J. Glob. Optim.",\n    volume = "92",\n    number = "1",\n    pages = "159--186",\n    year = "2025",\n    url = "https://doi.org/10.1007/s10898-024-01440-x",\n    doi = "10.1007/S10898-024-01440-X",\n    timestamp = "Thu, 25 Dec 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/jgo/SantisEPW25.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Relax and penalize: a new bilevel approach to mixed-binary hyperparameter optimization.\n \n \n \n \n\n\n \n Venturini, S.; Santis, M. D.; Patracone, J.; Schmidt, M.; Rinaldi, F.; and Salzo, S.\n\n\n \n\n\n\n Trans. Mach. Learn. Res., 2025. 2025.\n \n\n\n\n
\n\n\n\n \n \n \"RelaxPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/tmlr/VenturiniSP0RS25,\n    author = "Venturini, Sara and Santis, Marianna De and Patracone, Jordan and Schmidt, Martin and Rinaldi, Francesco and Salzo, Saverio",\n    title = "Relax and penalize: a new bilevel approach to mixed-binary hyperparameter optimization",\n    journal = "Trans. Mach. Learn. Res.",\n    volume = "2025",\n    year = "2025",\n    url = "https://openreview.net/forum?id=A1R1cQ93Cb",\n    timestamp = "Fri, 20 Jun 2025 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/tmlr/VenturiniSP0RS25.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Incorporating Fairness Into the Gateway-Based Risk Mitigation Policy for Hazmat Transport.\n \n \n \n \n\n\n \n Cappanera, P.; and Nonato, M.\n\n\n \n\n\n\n Networks, 85(2): 205–222. 2025.\n \n\n\n\n
\n\n\n\n \n \n \"IncorporatingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/networks/CappaneraN25,\n    author = "Cappanera, Paola and Nonato, Maddalena",\n    title = "Incorporating Fairness Into the Gateway-Based Risk Mitigation Policy for Hazmat Transport",\n    journal = "Networks",\n    volume = "85",\n    number = "2",\n    pages = "205--222",\n    year = "2025",\n    url = "https://doi.org/10.1002/net.22259",\n    doi = "10.1002/NET.22259",\n    timestamp = "Tue, 01 Apr 2025 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/networks/CappaneraN25.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A return-diversification approach to portfolio selection.\n \n \n \n \n\n\n \n Cesarone, F.; Giacometti, R.; Martino, M. L.; and Tardella, F.\n\n\n \n\n\n\n Comput. Manag. Sci., 22(2): 12. 2025.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/cms/CesaroneGMT25,\n    author = "Cesarone, Francesco and Giacometti, Rosella and Martino, Manuel Luis and Tardella, Fabio",\n    title = "A return-diversification approach to portfolio selection",\n    journal = "Comput. Manag. Sci.",\n    volume = "22",\n    number = "2",\n    pages = "12",\n    year = "2025",\n    url = "https://doi.org/10.1007/s10287-025-00538-1",\n    doi = "10.1007/S10287-025-00538-1",\n    timestamp = "Sun, 02 Nov 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/cms/CesaroneGMT25.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n In memoriam Franco Giannessi (1935-2025).\n \n \n \n \n\n\n \n Mastroeni, G.; Pappalardo, M.; Pellegrini, L.; and Tardella, F.\n\n\n \n\n\n\n Oper. Res. Forum, 6(4): 156. 2025.\n \n\n\n\n
\n\n\n\n \n \n \"InPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/orf/MastroeniPPT25,\n    author = "Mastroeni, Giandomenico and Pappalardo, Massimo and Pellegrini, Letizia and Tardella, Fabio",\n    title = "In memoriam Franco Giannessi {(1935-2025)}",\n    journal = "Oper. Res. Forum",\n    volume = "6",\n    number = "4",\n    pages = "156",\n    year = "2025",\n    url = "https://doi.org/10.1007/s43069-025-00557-3",\n    doi = "10.1007/S43069-025-00557-3",\n    timestamp = "Fri, 31 Oct 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/orf/MastroeniPPT25.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Robust Initialization of Residual Blocks for Effective ResNet Training Without Batch Normalization.\n \n \n \n \n\n\n \n Civitelli, E.; Sortino, A.; Lapucci, M.; Bagattini, F.; and Galvan, G.\n\n\n \n\n\n\n IEEE Trans. Neural Networks Learn. Syst., 36(1): 1947–1952. 2025.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/tnn/CivitelliSLBG25,\n    author = "Civitelli, Enrico and Sortino, Alessio and Lapucci, Matteo and Bagattini, Francesco and Galvan, Giulio",\n    title = "A Robust Initialization of Residual Blocks for Effective ResNet Training Without Batch Normalization",\n    journal = "{IEEE} Trans. Neural Networks Learn. Syst.",\n    volume = "36",\n    number = "1",\n    pages = "1947--1952",\n    year = "2025",\n    url = "https://doi.org/10.1109/TNNLS.2023.3325541",\n    doi = "10.1109/TNNLS.2023.3325541",\n    timestamp = "Sun, 15 Jun 2025 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/tnn/CivitelliSLBG25.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Bi-Objective Optimization Based Acquisition Strategy for Batch Bayesian Global Optimization.\n \n \n \n \n\n\n \n Carciaghi, F.; Magistri, S.; Mansueto, P.; and Schoen, F.\n\n\n \n\n\n\n Comput. Optim. Appl., 92(1): 81–123. 2025.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/coap/CarciaghiMMS25,\n    author = "Carciaghi, Francesco and Magistri, Simone and Mansueto, Pierluigi and Schoen, Fabio",\n    title = "A Bi-Objective Optimization Based Acquisition Strategy for Batch Bayesian Global Optimization",\n    journal = "Comput. Optim. Appl.",\n    volume = "92",\n    number = "1",\n    pages = "81--123",\n    year = "2025",\n    url = "https://doi.org/10.1007/s10589-025-00696-7",\n    doi = "10.1007/S10589-025-00696-7",\n    timestamp = "Tue, 14 Oct 2025 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/coap/CarciaghiMMS25.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n No Task Left Behind: Isotropic Model Merging with Common and Task-Specific Subspaces.\n \n \n \n \n\n\n \n Marczak, D.; Magistri, S.; Cygert, S.; Twardowski, B.; Bagdanov, A. D.; and van de Weijer, J.\n\n\n \n\n\n\n In Forty-second International Conference on Machine Learning, ICML 2025, Vancouver, BC, Canada, July 13-19, 2025, 2025. OpenReview.net\n \n\n\n\n
\n\n\n\n \n \n \"NoPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/icml/MarczakMCTB025,\n    author = "Marczak, Daniel and Magistri, Simone and Cygert, Sebastian and Twardowski, Bartlomiej and Bagdanov, Andrew D. and van de Weijer, Joost",\n    title = "No Task Left Behind: Isotropic Model Merging with Common and Task-Specific Subspaces",\n    booktitle = "Forty-second International Conference on Machine Learning, {ICML} 2025, Vancouver, BC, Canada, July 13-19, 2025",\n    publisher = "OpenReview.net",\n    year = "2025",\n    url = "https://openreview.net/forum?id=RBZpAa27ls",\n    timestamp = "Fri, 05 Dec 2025 10:58:04 +0100",\n    biburl = "https://dblp.org/rec/conf/icml/MarczakMCTB025.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n No Task Left Behind: Isotropic Model Merging with Common and Task-Specific Subspaces.\n \n \n \n \n\n\n \n Marczak, D.; Magistri, S.; Cygert, S.; Twardowski, B.; Bagdanov, A. D.; and van de Weijer, J.\n\n\n \n\n\n\n CoRR, abs/2502.04959. 2025.\n \n\n\n\n
\n\n\n\n \n \n \"NoPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2502-04959,\n    author = "Marczak, Daniel and Magistri, Simone and Cygert, Sebastian and Twardowski, Bartlomiej and Bagdanov, Andrew D. and van de Weijer, Joost",\n    title = "No Task Left Behind: Isotropic Model Merging with Common and Task-Specific Subspaces",\n    journal = "CoRR",\n    volume = "abs/2502.04959",\n    year = "2025",\n    url = "https://doi.org/10.48550/arXiv.2502.04959",\n    doi = "10.48550/ARXIV.2502.04959",\n    eprinttype = "arXiv",\n    eprint = "2502.04959",\n    timestamp = "Wed, 12 Mar 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/corr/abs-2502-04959.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n EFC++: Elastic Feature Consolidation with Prototype Re-balancing for Cold Start Exemplar-free Incremental Learning.\n \n \n \n \n\n\n \n Magistri, S.; Trinci, T.; Soutif-Cormerais, A.; van de Weijer, J.; and Bagdanov, A. D.\n\n\n \n\n\n\n CoRR, abs/2503.10439. 2025.\n \n\n\n\n
\n\n\n\n \n \n \"EFC++:Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2503-10439,\n    author = "Magistri, Simone and Trinci, Tomaso and Soutif{-}Cormerais, Albin and van de Weijer, Joost and Bagdanov, Andrew D.",\n    title = "{EFC++:} Elastic Feature Consolidation with Prototype Re-balancing for Cold Start Exemplar-free Incremental Learning",\n    journal = "CoRR",\n    volume = "abs/2503.10439",\n    year = "2025",\n    url = "https://doi.org/10.48550/arXiv.2503.10439",\n    doi = "10.48550/ARXIV.2503.10439",\n    eprinttype = "arXiv",\n    eprint = "2503.10439",\n    timestamp = "Sun, 13 Apr 2025 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/corr/abs-2503-10439.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Accurate and Efficient Low-Rank Model Merging in Core Space.\n \n \n \n \n\n\n \n Panariello, A.; Marczak, D.; Magistri, S.; Porrello, A.; Twardowski, B.; Bagdanov, A. D.; Calderara, S.; and van de Weijer, J.\n\n\n \n\n\n\n CoRR, abs/2509.17786. 2025.\n \n\n\n\n
\n\n\n\n \n \n \"AccuratePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2509-17786,\n    author = "Panariello, Aniello and Marczak, Daniel and Magistri, Simone and Porrello, Angelo and Twardowski, Bartlomiej and Bagdanov, Andrew D. and Calderara, Simone and van de Weijer, Joost",\n    title = "Accurate and Efficient Low-Rank Model Merging in Core Space",\n    journal = "CoRR",\n    volume = "abs/2509.17786",\n    year = "2025",\n    url = "https://doi.org/10.48550/arXiv.2509.17786",\n    doi = "10.48550/ARXIV.2509.17786",\n    eprinttype = "arXiv",\n    eprint = "2509.17786",\n    timestamp = "Sat, 18 Oct 2025 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/corr/abs-2509-17786.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2024\n \n \n (24)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n An oracle-based framework for robust combinatorial optimization.\n \n \n \n \n\n\n \n Bettiol, E.; Buchheim, C.; Santis, M. D.; and Rinaldi, F.\n\n\n \n\n\n\n J. Glob. Optim., 88(1): 27–51. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jgo/BettiolBSR24,\n    author = "Bettiol, Enrico and Buchheim, Christoph and Santis, Marianna De and Rinaldi, Francesco",\n    title = "An oracle-based framework for robust combinatorial optimization",\n    journal = "J. Glob. Optim.",\n    volume = "88",\n    number = "1",\n    pages = "27--51",\n    year = "2024",\n    url = "https://doi.org/10.1007/s10898-023-01271-2",\n    doi = "10.1007/S10898-023-01271-2",\n    timestamp = "Mon, 03 Mar 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/jgo/BettiolBSR24.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Necessary Optimality Conditions for Sets of Points in Multiobjective Optimization.\n \n \n \n \n\n\n \n Cristofari, A.; Santis, M. D.; and Lucidi, S.\n\n\n \n\n\n\n J. Optim. Theory Appl., 203(1): 126–145. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jota/CristofariSL24,\n    author = "Cristofari, Andrea and Santis, Marianna De and Lucidi, Stefano",\n    title = "On Necessary Optimality Conditions for Sets of Points in Multiobjective Optimization",\n    journal = "J. Optim. Theory Appl.",\n    volume = "203",\n    number = "1",\n    pages = "126--145",\n    year = "2024",\n    url = "https://doi.org/10.1007/s10957-024-02478-3",\n    doi = "10.1007/S10957-024-02478-3",\n    timestamp = "Mon, 09 Dec 2024 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/jota/CristofariSL24.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Designing sustainable diet plans by solving triobjective integer programs.\n \n \n \n \n\n\n \n Benvenuti, L.; Santis, A. D.; Santis, M. D.; and Patria, D.\n\n\n \n\n\n\n Math. Methods Oper. Res., 100(3): 703–721. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"DesigningPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/mmor/BenvenutiSSP24,\n    author = "Benvenuti, Luca and Santis, Alberto De and Santis, Marianna De and Patria, Daniele",\n    title = "Designing sustainable diet plans by solving triobjective integer programs",\n    journal = "Math. Methods Oper. Res.",\n    volume = "100",\n    number = "3",\n    pages = "703--721",\n    year = "2024",\n    url = "https://doi.org/10.1007/s00186-024-00879-8",\n    doi = "10.1007/S00186-024-00879-8",\n    timestamp = "Mon, 03 Mar 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/mmor/BenvenutiSSP24.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Augmented patterns for decomposition of scheduling and assignment problems.\n \n \n \n \n\n\n \n Cappanera, P.; Matta, A.; Scutellà, M. G.; and Singuaroli, M.\n\n\n \n\n\n\n Eur. J. Oper. Res., 319(2): 517–530. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"AugmentedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/eor/CappaneraMSS24,\n    author = "Cappanera, Paola and Matta, Andrea and Scutell{\\`{a}}, Maria Grazia and Singuaroli, Martino",\n    title = "Augmented patterns for decomposition of scheduling and assignment problems",\n    journal = "Eur. J. Oper. Res.",\n    volume = "319",\n    number = "2",\n    pages = "517--530",\n    year = "2024",\n    url = "https://doi.org/10.1016/j.ejor.2024.06.004",\n    doi = "10.1016/J.EJOR.2024.06.004",\n    timestamp = "Sun, 08 Sep 2024 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/eor/CappaneraMSS24.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Integrated task scheduling and personnel rostering of airports ground staff: A case study.\n \n \n \n \n\n\n \n Cappanera, P.; Gangi, L. D.; Lapucci, M.; Pellegrini, G.; Roma, M.; Schoen, F.; and Sortino, A.\n\n\n \n\n\n\n Expert Syst. Appl., 238(Part C): 121953. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"IntegratedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/eswa/CappaneraGLPRSS24,\n    author = "Cappanera, Paola and Gangi, Leonardo Di and Lapucci, Matteo and Pellegrini, Giulia and Roma, Marco and Schoen, Fabio and Sortino, Alessio",\n    title = "Integrated task scheduling and personnel rostering of airports ground staff: {A} case study",\n    journal = "Expert Syst. Appl.",\n    volume = "238",\n    number = "Part {C}",\n    pages = "121953",\n    year = "2024",\n    url = "https://doi.org/10.1016/j.eswa.2023.121953",\n    doi = "10.1016/J.ESWA.2023.121953",\n    timestamp = "Fri, 08 Mar 2024 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/eswa/CappaneraGLPRSS24.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Genetic Algorithm for Placing VNF Chains with Multiple Flavours.\n \n \n \n \n\n\n \n Serra, A.; Paganelli, F.; Brogi, A.; and Cappanera, P.\n\n\n \n\n\n\n In IEEE Symposium on Computers and Communications, ISCC 2024, Paris, France, June 26-29, 2024, pages 1–6, 2024. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/iscc/SerraPBC24,\n    author = "Serra, Antonio and Paganelli, Federica and Brogi, Antonio and Cappanera, Paola",\n    title = "A Genetic Algorithm for Placing {VNF} Chains with Multiple Flavours",\n    booktitle = "{IEEE} Symposium on Computers and Communications, {ISCC} 2024, Paris, France, June 26-29, 2024",\n    pages = "1--6",\n    publisher = "{IEEE}",\n    year = "2024",\n    url = "https://doi.org/10.1109/ISCC61673.2024.10733678",\n    doi = "10.1109/ISCC61673.2024.10733678",\n    timestamp = "Wed, 06 Nov 2024 15:51:31 +0100",\n    biburl = "https://dblp.org/rec/conf/iscc/SerraPBC24.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Recent Answer Set Programming Applications to Scheduling Problems in Digital Health.\n \n \n \n \n\n\n \n Cappanera, P.; Caruso, S.; Dodaro, C.; Galatà, G.; Gavanelli, M.; Maratea, M.; Marte, C.; Mochi, M.; Nonato, M.; and Roma, M.\n\n\n \n\n\n\n In Aineto, D.; Benedictis, R. D.; Maratea, M.; Mittelmann, M.; Monaco, G.; Scala, E.; Serafini, L.; Serina, I.; Spegni, F.; Tosello, E.; Umbrico, A.; and Vallati, M., editor(s), Proceedings of the International Workshop on Artificial Intelligence for Climate Change, Italian Workshop on Planning and Scheduling, RCRA Workshop on Experimental evaluation of algorithms for solving problems with combinatorial explosion, and SPIRIT Workshop on Strategies, Prediction, Interaction, and Reasoning in Italy (AI4CC-IPS-RCRA-SPIRIT 2024) co-located with 23rd International Conference of the Italian Association for Artificial Intelligence AIxIA 2024, November 25-28th, 2024, Bolzano, Italy, volume 3883, of CEUR Workshop Proceedings, 2024. CEUR-WS.org\n \n\n\n\n
\n\n\n\n \n \n \"RecentPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/rcra/CappaneraCDGGMM24,\n    author = "Cappanera, Paola and Caruso, Simone and Dodaro, Carmine and Galat{\\`{a}}, Giuseppe and Gavanelli, Marco and Maratea, Marco and Marte, Cinzia and Mochi, Marco and Nonato, Maddalena and Roma, Marco",\n    editor = "Aineto, Diego and Benedictis, Riccardo De and Maratea, Marco and Mittelmann, Munyque and Monaco, Gianpiero and Scala, Enrico and Serafini, Luciano and Serina, Ivan and Spegni, Francesco and Tosello, Elisa and Umbrico, Alessandro and Vallati, Mauro",\n    title = "Recent Answer Set Programming Applications to Scheduling Problems in Digital Health",\n    booktitle = "Proceedings of the International Workshop on Artificial Intelligence for Climate Change, Italian Workshop on Planning and Scheduling, {RCRA} Workshop on Experimental evaluation of algorithms for solving problems with combinatorial explosion, and {SPIRIT} Workshop on Strategies, Prediction, Interaction, and Reasoning in Italy {(AI4CC-IPS-RCRA-SPIRIT} 2024) co-located with 23rd International Conference of the Italian Association for Artificial Intelligence AIxIA 2024, November 25-28th, 2024, Bolzano, Italy",\n    series = "{CEUR} Workshop Proceedings",\n    volume = "3883",\n    publisher = "CEUR-WS.org",\n    year = "2024",\n    url = "https://ceur-ws.org/Vol-3883/paper3\\\\_RCRA8.pdf",\n    timestamp = "Thu, 16 Jan 2025 17:14:33 +0100",\n    biburl = "https://dblp.org/rec/conf/rcra/CappaneraCDGGMM24.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Advances in nonlinear optimization and equilibrium problems - Special issue editorial.\n \n \n \n \n\n\n \n Lapucci, M.; and Schoen, F.\n\n\n \n\n\n\n EURO J. Comput. Optim., 12: 100086. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"AdvancesPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/ejco/LapucciS24,\n    author = "Lapucci, Matteo and Schoen, Fabio",\n    title = "Advances in nonlinear optimization and equilibrium problems - Special issue editorial",\n    journal = "{EURO} J. Comput. Optim.",\n    volume = "12",\n    pages = "100086",\n    year = "2024",\n    url = "https://doi.org/10.1016/j.ejco.2024.100086",\n    doi = "10.1016/J.EJCO.2024.100086",\n    timestamp = "Thu, 22 Aug 2024 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/ejco/LapucciS24.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Cardinality-Constrained Multi-objective Optimization: Novel Optimality Conditions and Algorithms.\n \n \n \n \n\n\n \n Lapucci, M.; and Mansueto, P.\n\n\n \n\n\n\n J. Optim. Theory Appl., 201(1): 323–351. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"Cardinality-ConstrainedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jota/LapucciM24,\n    author = "Lapucci, Matteo and Mansueto, Pierluigi",\n    title = "Cardinality-Constrained Multi-objective Optimization: Novel Optimality Conditions and Algorithms",\n    journal = "J. Optim. Theory Appl.",\n    volume = "201",\n    number = "1",\n    pages = "323--351",\n    year = "2024",\n    url = "https://doi.org/10.1007/s10957-024-02397-3",\n    doi = "10.1007/S10957-024-02397-3",\n    timestamp = "Sun, 07 Dec 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/jota/LapucciM24.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Convergence of Inexact Alternate Minimization in Problems with \\(ℓ\\) \\(_\\mbox0\\) Penalties.\n \n \n \n \n\n\n \n Lapucci, M.; and Sortino, A.\n\n\n \n\n\n\n Oper. Res. Forum, 5(2): 41. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/orf/LapucciS24,\n    author = "Lapucci, Matteo and Sortino, Alessio",\n    title = "On the Convergence of Inexact Alternate Minimization in Problems with {\\(\\mathscr{l}\\)} \\({}\\_{\\mbox{0}}\\) Penalties",\n    journal = "Oper. Res. Forum",\n    volume = "5",\n    number = "2",\n    pages = "41",\n    year = "2024",\n    url = "https://doi.org/10.1007/s43069-024-00323-x",\n    doi = "10.1007/S43069-024-00323-X",\n    timestamp = "Sun, 07 Dec 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/orf/LapucciS24.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Convergence and complexity guarantees for a wide class of descent algorithms in nonconvex multi-objective optimization.\n \n \n \n \n\n\n \n Lapucci, M.\n\n\n \n\n\n\n Oper. Res. Lett., 54: 107115. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"ConvergencePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/orl/Lapucci24,\n    author = "Lapucci, Matteo",\n    title = "Convergence and complexity guarantees for a wide class of descent algorithms in nonconvex multi-objective optimization",\n    journal = "Oper. Res. Lett.",\n    volume = "54",\n    pages = "107115",\n    year = "2024",\n    url = "https://doi.org/10.1016/j.orl.2024.107115",\n    doi = "10.1016/J.ORL.2024.107115",\n    timestamp = "Fri, 19 Jul 2024 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/orl/Lapucci24.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Convergence Conditions for Stochastic Line Search Based Optimization of Over-parametrized Models.\n \n \n \n \n\n\n \n Lapucci, M.; and Pucci, D.\n\n\n \n\n\n\n CoRR, abs/2408.03199. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"ConvergencePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2408-03199,\n    author = "Lapucci, Matteo and Pucci, Davide",\n    title = "Convergence Conditions for Stochastic Line Search Based Optimization of Over-parametrized Models",\n    journal = "CoRR",\n    volume = "abs/2408.03199",\n    year = "2024",\n    url = "https://doi.org/10.48550/arXiv.2408.03199",\n    doi = "10.48550/ARXIV.2408.03199",\n    eprinttype = "arXiv",\n    eprint = "2408.03199",\n    timestamp = "Sun, 07 Dec 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/corr/abs-2408-03199.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Effectively Leveraging Momentum Terms in Stochastic Line Search Frameworks for Fast Optimization of Finite-Sum Problems.\n \n \n \n \n\n\n \n Lapucci, M.; and Pucci, D.\n\n\n \n\n\n\n CoRR, abs/2411.07102. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"EffectivelyPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2411-07102,\n    author = "Lapucci, Matteo and Pucci, Davide",\n    title = "Effectively Leveraging Momentum Terms in Stochastic Line Search Frameworks for Fast Optimization of Finite-Sum Problems",\n    journal = "CoRR",\n    volume = "abs/2411.07102",\n    year = "2024",\n    url = "https://doi.org/10.48550/arXiv.2411.07102",\n    doi = "10.48550/ARXIV.2411.07102",\n    eprinttype = "arXiv",\n    eprint = "2411.07102",\n    timestamp = "Sun, 07 Dec 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/corr/abs-2411-07102.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Optimization-Driven Design of Monolithic Soft-Rigid Grippers.\n \n \n \n \n\n\n \n Mansueto, P.; Dragusanu, M.; Saeed, A.; Malvezzi, M.; Lapucci, M.; and Salvietti, G.\n\n\n \n\n\n\n CoRR, abs/2412.07556. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"Optimization-DrivenPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2412-07556,\n    author = "Mansueto, Pierluigi and Dragusanu, Mihai and Saeed, Anjum and Malvezzi, Monica and Lapucci, Matteo and Salvietti, Gionata",\n    title = "Optimization-Driven Design of Monolithic Soft-Rigid Grippers",\n    journal = "CoRR",\n    volume = "abs/2412.07556",\n    year = "2024",\n    url = "https://doi.org/10.48550/arXiv.2412.07556",\n    doi = "10.48550/ARXIV.2412.07556",\n    eprinttype = "arXiv",\n    eprint = "2412.07556",\n    timestamp = "Sun, 07 Dec 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/corr/abs-2412-07556.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Memetic Differential Evolution Methods for Semi-Supervised Clustering.\n \n \n \n \n\n\n \n Mansueto, P.; and Schoen, F.\n\n\n \n\n\n\n CoRR, abs/2403.04322. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"MemeticPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2403-04322,\n    author = "Mansueto, Pierluigi and Schoen, Fabio",\n    title = "Memetic Differential Evolution Methods for Semi-Supervised Clustering",\n    journal = "CoRR",\n    volume = "abs/2403.04322",\n    year = "2024",\n    url = "https://doi.org/10.48550/arXiv.2403.04322",\n    doi = "10.48550/ARXIV.2403.04322",\n    eprinttype = "arXiv",\n    eprint = "2403.04322",\n    timestamp = "Sun, 06 Oct 2024 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/corr/abs-2403-04322.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Continual learning for adaptive social network identification.\n \n \n \n \n\n\n \n Magistri, S.; Baracchi, D.; Shullani, D.; Bagdanov, A. D.; and Piva, A.\n\n\n \n\n\n\n Pattern Recognit. Lett., 180: 82–89. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"ContinualPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/prl/MagistriBSBP24,\n    author = "Magistri, Simone and Baracchi, Daniele and Shullani, Dasara and Bagdanov, Andrew D. and Piva, Alessandro",\n    title = "Continual learning for adaptive social network identification",\n    journal = "Pattern Recognit. Lett.",\n    volume = "180",\n    pages = "82--89",\n    year = "2024",\n    url = "https://doi.org/10.1016/j.patrec.2024.02.020",\n    doi = "10.1016/J.PATREC.2024.02.020",\n    timestamp = "Sun, 04 Aug 2024 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/prl/MagistriBSBP24.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Empirical Analysis of Forgetting in Pre-trained Models with Incremental Low-Rank Updates.\n \n \n \n \n\n\n \n Soutif, A.; Magistri, S.; van de Weijer, J.; and Bagdanov, A. D.\n\n\n \n\n\n\n In Lomonaco, V.; Melacci, S.; Tuytelaars, T.; Chandar, S.; and Pascanu, R., editor(s), Conference on Lifelong Learning Agents, 29-1 August 2024, University of Pisa, Pisa, Italy, volume 274, of Proceedings of Machine Learning Research, pages 996–1012, 2024. PMLR\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/collas/SoutifM0B24,\n    author = "Soutif, Albin and Magistri, Simone and van de Weijer, Joost and Bagdanov, Andrew D.",\n    editor = "Lomonaco, Vincenzo and Melacci, Stefano and Tuytelaars, Tinne and Chandar, Sarath and Pascanu, Razvan",\n    title = "An Empirical Analysis of Forgetting in Pre-trained Models with Incremental Low-Rank Updates",\n    booktitle = "Conference on Lifelong Learning Agents, 29-1 August 2024, University of Pisa, Pisa, Italy",\n    series = "Proceedings of Machine Learning Research",\n    volume = "274",\n    pages = "996--1012",\n    publisher = "{PMLR}",\n    year = "2024",\n    url = "https://proceedings.mlr.press/v274/soutif25a.html",\n    timestamp = "Thu, 20 Mar 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/conf/collas/SoutifM0B24.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n How Green Is Continual Learning, Really? Analyzing the Energy Consumption in Continual Training of Vision Foundation Models.\n \n \n \n \n\n\n \n Trinci, T.; Magistri, S.; Verdecchia, R.; and Bagdanov, A. D.\n\n\n \n\n\n\n In Bue, A. D.; Canton, C.; Pont-Tuset, J.; and Tommasi, T., editor(s), Computer Vision - ECCV 2024 Workshops - Milan, Italy, September 29-October 4, 2024, Proceedings, Part XXII, volume 15644, of Lecture Notes in Computer Science, pages 300–317, 2024. Springer\n \n\n\n\n
\n\n\n\n \n \n \"HowPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/eccv/TrinciMVB24,\n    author = "Trinci, Tomaso and Magistri, Simone and Verdecchia, Roberto and Bagdanov, Andrew D.",\n    editor = "Bue, Alessio Del and Canton, Cristian and Pont{-}Tuset, Jordi and Tommasi, Tatiana",\n    title = "How Green Is Continual Learning, Really? Analyzing the Energy Consumption in Continual Training of Vision Foundation Models",\n    booktitle = "Computer Vision - {ECCV} 2024 Workshops - Milan, Italy, September 29-October 4, 2024, Proceedings, Part {XXII}",\n    series = "Lecture Notes in Computer Science",\n    volume = "15644",\n    pages = "300--317",\n    publisher = "Springer",\n    year = "2024",\n    url = "https://doi.org/10.1007/978-3-031-92089-9\\\\_19",\n    doi = "10.1007/978-3-031-92089-9\\\\_19",\n    timestamp = "Fri, 04 Jul 2025 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/conf/eccv/TrinciMVB24.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Incremental and Decremental Continual Learning for Privacy-Preserving Video Recognition.\n \n \n \n \n\n\n \n Caselli, L.; Magistri, S.; Bianconcini, T.; Benericetti, A.; de Andrade, D. C.; and Bagdanov, A. D.\n\n\n \n\n\n\n In Bue, A. D.; Canton, C.; Pont-Tuset, J.; and Tommasi, T., editor(s), Computer Vision - ECCV 2024 Workshops - Milan, Italy, September 29-October 4, 2024, Proceedings, Part XXI, volume 15643, of Lecture Notes in Computer Science, pages 333–350, 2024. Springer\n \n\n\n\n
\n\n\n\n \n \n \"IncrementalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/eccv/CaselliMBBAB24,\n    author = "Caselli, Lorenzo and Magistri, Simone and Bianconcini, Tommaso and Benericetti, Andrea and de Andrade, Douglas Coimbra and Bagdanov, Andrew D.",\n    editor = "Bue, Alessio Del and Canton, Cristian and Pont{-}Tuset, Jordi and Tommasi, Tatiana",\n    title = "Incremental and Decremental Continual Learning for Privacy-Preserving Video Recognition",\n    booktitle = "Computer Vision - {ECCV} 2024 Workshops - Milan, Italy, September 29-October 4, 2024, Proceedings, Part {XXI}",\n    series = "Lecture Notes in Computer Science",\n    volume = "15643",\n    pages = "333--350",\n    publisher = "Springer",\n    year = "2024",\n    url = "https://doi.org/10.1007/978-3-031-92648-8\\\\_20",\n    doi = "10.1007/978-3-031-92648-8\\\\_20",\n    timestamp = "Tue, 05 Aug 2025 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/conf/eccv/CaselliMBBAB24.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Elastic Feature Consolidation For Cold Start Exemplar-Free Incremental Learning.\n \n \n \n \n\n\n \n Magistri, S.; Trinci, T.; Soutif-Cormerais, A.; van de Weijer, J.; and Bagdanov, A. D.\n\n\n \n\n\n\n In The Twelfth International Conference on Learning Representations, ICLR 2024, Vienna, Austria, May 7-11, 2024, 2024. OpenReview.net\n \n\n\n\n
\n\n\n\n \n \n \"ElasticPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/iclr/MagistriTS0B24,\n    author = "Magistri, Simone and Trinci, Tomaso and Soutif{-}Cormerais, Albin and van de Weijer, Joost and Bagdanov, Andrew D.",\n    title = "Elastic Feature Consolidation For Cold Start Exemplar-Free Incremental Learning",\n    booktitle = "The Twelfth International Conference on Learning Representations, {ICLR} 2024, Vienna, Austria, May 7-11, 2024",\n    publisher = "OpenReview.net",\n    year = "2024",\n    url = "https://openreview.net/forum?id=7D9X2cFnt1",\n    timestamp = "Wed, 07 Aug 2024 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/conf/iclr/MagistriTS0B24.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Elastic Feature Consolidation for Cold Start Exemplar-free Incremental Learning.\n \n \n \n \n\n\n \n Magistri, S.; Trinci, T.; Soutif-Cormerais, A.; van de Weijer, J.; and Bagdanov, A. D.\n\n\n \n\n\n\n CoRR, abs/2402.03917. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"ElasticPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2402-03917,\n    author = "Magistri, Simone and Trinci, Tomaso and Soutif{-}Cormerais, Albin and van de Weijer, Joost and Bagdanov, Andrew D.",\n    title = "Elastic Feature Consolidation for Cold Start Exemplar-free Incremental Learning",\n    journal = "CoRR",\n    volume = "abs/2402.03917",\n    year = "2024",\n    url = "https://doi.org/10.48550/arXiv.2402.03917",\n    doi = "10.48550/ARXIV.2402.03917",\n    eprinttype = "arXiv",\n    eprint = "2402.03917",\n    timestamp = "Mon, 12 Feb 2024 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/corr/abs-2402-03917.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Empirical Analysis of Forgetting in Pre-trained Models with Incremental Low-Rank Updates.\n \n \n \n \n\n\n \n Soutif-Cormerais, A.; Magistri, S.; van de Weijer, J.; and Bagdanov, A. D.\n\n\n \n\n\n\n CoRR, abs/2405.18069. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2405-18069,\n    author = "Soutif{-}Cormerais, Albin and Magistri, Simone and van de Weijer, Joost and Bagdanov, Andrew D.",\n    title = "An Empirical Analysis of Forgetting in Pre-trained Models with Incremental Low-Rank Updates",\n    journal = "CoRR",\n    volume = "abs/2405.18069",\n    year = "2024",\n    url = "https://doi.org/10.48550/arXiv.2405.18069",\n    doi = "10.48550/ARXIV.2405.18069",\n    eprinttype = "arXiv",\n    eprint = "2405.18069",\n    timestamp = "Fri, 21 Jun 2024 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/corr/abs-2405-18069.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n How green is continual learning, really? Analyzing the energy consumption in continual training of vision foundation models.\n \n \n \n \n\n\n \n Trinci, T.; Magistri, S.; Verdecchia, R.; and Bagdanov, A. D.\n\n\n \n\n\n\n CoRR, abs/2409.18664. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"HowPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2409-18664,\n    author = "Trinci, Tomaso and Magistri, Simone and Verdecchia, Roberto and Bagdanov, Andrew D.",\n    title = "How green is continual learning, really? Analyzing the energy consumption in continual training of vision foundation models",\n    journal = "CoRR",\n    volume = "abs/2409.18664",\n    year = "2024",\n    url = "https://doi.org/10.48550/arXiv.2409.18664",\n    doi = "10.48550/ARXIV.2409.18664",\n    eprinttype = "arXiv",\n    eprint = "2409.18664",\n    timestamp = "Thu, 17 Oct 2024 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/corr/abs-2409-18664.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Covariances for Free: Exploiting Mean Distributions for Federated Learning with Pre-Trained Models.\n \n \n \n \n\n\n \n Goswami, D.; Magistri, S.; Wang, K.; Twardowski, B.; Bagdanov, A. D.; and van de Weijer, J.\n\n\n \n\n\n\n CoRR, abs/2412.14326. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"CovariancesPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2412-14326,\n    author = "Goswami, Dipam and Magistri, Simone and Wang, Kai and Twardowski, Bartlomiej and Bagdanov, Andrew D. and van de Weijer, Joost",\n    title = "Covariances for Free: Exploiting Mean Distributions for Federated Learning with Pre-Trained Models",\n    journal = "CoRR",\n    volume = "abs/2412.14326",\n    year = "2024",\n    url = "https://doi.org/10.48550/arXiv.2412.14326",\n    doi = "10.48550/ARXIV.2412.14326",\n    eprinttype = "arXiv",\n    eprint = "2412.14326",\n    timestamp = "Thu, 23 Jan 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/corr/abs-2412-14326.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2023\n \n \n (15)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Relax and penalize: a new bilevel approach to mixed-binary hyperparameter optimization.\n \n \n \n \n\n\n \n Santis, M. D.; Frécon, J.; Rinaldi, F.; Salzo, S.; and Schmidt, M.\n\n\n \n\n\n\n CoRR, abs/2308.10711. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"RelaxPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2308-10711,\n    author = "Santis, Marianna De and Fr{\\'{e}}con, Jordan and Rinaldi, Francesco and Salzo, Saverio and Schmidt, Martin",\n    title = "Relax and penalize: a new bilevel approach to mixed-binary hyperparameter optimization",\n    journal = "CoRR",\n    volume = "abs/2308.10711",\n    year = "2023",\n    url = "https://doi.org/10.48550/arXiv.2308.10711",\n    doi = "10.48550/ARXIV.2308.10711",\n    eprinttype = "arXiv",\n    eprint = "2308.10711",\n    timestamp = "Thu, 13 Jun 2024 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/corr/abs-2308-10711.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Decomposition approaches for scheduling chronic outpatients' clinical pathways in Answer Set Programming.\n \n \n \n \n\n\n \n Cappanera, P.; Gavanelli, M.; Nonato, M.; and Roma, M.\n\n\n \n\n\n\n J. Log. Comput., 33(8): 1851–1871. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"DecompositionPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/logcom/CappaneraGNR23,\n    author = "Cappanera, Paola and Gavanelli, Marco and Nonato, Maddalena and Roma, Marco",\n    title = "Decomposition approaches for scheduling chronic outpatients' clinical pathways in Answer Set Programming",\n    journal = "J. Log. Comput.",\n    volume = "33",\n    number = "8",\n    pages = "1851--1871",\n    year = "2023",\n    url = "https://doi.org/10.1093/logcom/exad038",\n    doi = "10.1093/LOGCOM/EXAD038",\n    timestamp = "Mon, 05 Feb 2024 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/logcom/CappaneraGNR23.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Logic-Based Benders Decomposition in Answer Set Programming for Chronic Outpatients Scheduling.\n \n \n \n \n\n\n \n Cappanera, P.; Gavanelli, M.; Nonato, M.; and Roma, M.\n\n\n \n\n\n\n Theory Pract. Log. Program., 23(4): 848–864. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"Logic-BasedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/tplp/CappaneraGNR23,\n    author = "Cappanera, Paola and Gavanelli, Marco and Nonato, Maddalena and Roma, Marco",\n    title = "Logic-Based Benders Decomposition in Answer Set Programming for Chronic Outpatients Scheduling",\n    journal = "Theory Pract. Log. Program.",\n    volume = "23",\n    number = "4",\n    pages = "848--864",\n    year = "2023",\n    url = "https://doi.org/10.1017/s147106842300025x",\n    doi = "10.1017/S147106842300025X",\n    timestamp = "Sat, 16 Mar 2024 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/tplp/CappaneraGNR23.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Logic-Based Benders Decomposition in Answer Set Programming for Chronic Outpatients Scheduling.\n \n \n \n \n\n\n \n Cappanera, P.; Gavanelli, M.; Nonato, M.; and Roma, M.\n\n\n \n\n\n\n CoRR, abs/2305.11969. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"Logic-BasedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2305-11969,\n    author = "Cappanera, Paola and Gavanelli, Marco and Nonato, Maddalena and Roma, Marco",\n    title = "Logic-Based Benders Decomposition in Answer Set Programming for Chronic Outpatients Scheduling",\n    journal = "CoRR",\n    volume = "abs/2305.11969",\n    year = "2023",\n    url = "https://doi.org/10.48550/arXiv.2305.11969",\n    doi = "10.48550/ARXIV.2305.11969",\n    eprinttype = "arXiv",\n    eprint = "2305.11969",\n    timestamp = "Fri, 26 May 2023 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/corr/abs-2305-11969.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Mean-Variance-VaR portfolios: MIQP formulation and performance analysis.\n \n \n \n \n\n\n \n Cesarone, F.; Martino, M. L.; and Tardella, F.\n\n\n \n\n\n\n OR Spectr., 45(3): 1043–1069. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"Mean-Variance-VaRPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/ors/CesaroneMT23,\n    author = "Cesarone, Francesco and Martino, Manuel Luis and Tardella, Fabio",\n    title = "Mean-Variance-VaR portfolios: {MIQP} formulation and performance analysis",\n    journal = "{OR} Spectr.",\n    volume = "45",\n    number = "3",\n    pages = "1043--1069",\n    year = "2023",\n    url = "https://doi.org/10.1007/s00291-023-00719-x",\n    doi = "10.1007/S00291-023-00719-X",\n    timestamp = "Mon, 29 Jul 2024 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/ors/CesaroneMT23.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A limited memory Quasi-Newton approach for multi-objective optimization.\n \n \n \n \n\n\n \n Lapucci, M.; and Mansueto, P.\n\n\n \n\n\n\n Comput. Optim. Appl., 85(1): 33–73. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/coap/LapucciM23,\n    author = "Lapucci, Matteo and Mansueto, Pierluigi",\n    title = "A limited memory Quasi-Newton approach for multi-objective optimization",\n    journal = "Comput. Optim. Appl.",\n    volume = "85",\n    number = "1",\n    pages = "33--73",\n    year = "2023",\n    url = "https://doi.org/10.1007/s10589-023-00454-7",\n    doi = "10.1007/S10589-023-00454-7",\n    timestamp = "Sat, 13 May 2023 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/coap/LapucciM23.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Inexact penalty decomposition methods for optimization problems with geometric constraints.\n \n \n \n \n\n\n \n Kanzow, C.; and Lapucci, M.\n\n\n \n\n\n\n Comput. Optim. Appl., 85(3): 937–971. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"InexactPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/coap/KanzowL23,\n    author = "Kanzow, Christian and Lapucci, Matteo",\n    title = "Inexact penalty decomposition methods for optimization problems with geometric constraints",\n    journal = "Comput. Optim. Appl.",\n    volume = "85",\n    number = "3",\n    pages = "937--971",\n    year = "2023",\n    url = "https://doi.org/10.1007/s10589-023-00475-2",\n    doi = "10.1007/S10589-023-00475-2",\n    timestamp = "Tue, 12 Sep 2023 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/coap/KanzowL23.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Unifying Framework for Sparsity-Constrained Optimization.\n \n \n \n \n\n\n \n Lapucci, M.; Levato, T.; Rinaldi, F.; and Sciandrone, M.\n\n\n \n\n\n\n J. Optim. Theory Appl., 199(2): 663–692. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jota/LapucciLRS23,\n    author = "Lapucci, Matteo and Levato, Tommaso and Rinaldi, Francesco and Sciandrone, Marco",\n    title = "A Unifying Framework for Sparsity-Constrained Optimization",\n    journal = "J. Optim. Theory Appl.",\n    volume = "199",\n    number = "2",\n    pages = "663--692",\n    year = "2023",\n    url = "https://doi.org/10.1007/s10957-023-02306-0",\n    doi = "10.1007/S10957-023-02306-0",\n    timestamp = "Sat, 08 Jun 2024 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/jota/LapucciLRS23.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A memetic procedure for global multi-objective optimization.\n \n \n \n \n\n\n \n Lapucci, M.; Mansueto, P.; and Schoen, F.\n\n\n \n\n\n\n Math. Program. Comput., 15(2): 227–267. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/mpc/LapucciMS23,\n    author = "Lapucci, Matteo and Mansueto, Pierluigi and Schoen, Fabio",\n    title = "A memetic procedure for global multi-objective optimization",\n    journal = "Math. Program. Comput.",\n    volume = "15",\n    number = "2",\n    pages = "227--267",\n    year = "2023",\n    url = "https://doi.org/10.1007/s12532-022-00231-3",\n    doi = "10.1007/S12532-022-00231-3",\n    timestamp = "Tue, 12 Sep 2023 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/mpc/LapucciMS23.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Improved front steepest descent for multi-objective optimization.\n \n \n \n \n\n\n \n Lapucci, M.; and Mansueto, P.\n\n\n \n\n\n\n Oper. Res. Lett., 51(3): 242–247. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"ImprovedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/orl/LapucciM23,\n    author = "Lapucci, Matteo and Mansueto, Pierluigi",\n    title = "Improved front steepest descent for multi-objective optimization",\n    journal = "Oper. Res. Lett.",\n    volume = "51",\n    number = "3",\n    pages = "242--247",\n    year = "2023",\n    url = "https://doi.org/10.1016/j.orl.2023.03.001",\n    doi = "10.1016/J.ORL.2023.03.001",\n    timestamp = "Fri, 18 Aug 2023 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/orl/LapucciM23.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Loss-Optimal Classification Trees: A Generalized Framework and the Logistic Case.\n \n \n \n \n\n\n \n Aldinucci, T.; and Lapucci, M.\n\n\n \n\n\n\n CoRR, abs/2306.00857. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"Loss-OptimalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2306-00857,\n    author = "Aldinucci, Tommaso and Lapucci, Matteo",\n    title = "Loss-Optimal Classification Trees: {A} Generalized Framework and the Logistic Case",\n    journal = "CoRR",\n    volume = "abs/2306.00857",\n    year = "2023",\n    url = "https://doi.org/10.48550/arXiv.2306.00857",\n    doi = "10.48550/ARXIV.2306.00857",\n    eprinttype = "arXiv",\n    eprint = "2306.00857",\n    timestamp = "Sun, 07 Dec 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/corr/abs-2306-00857.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Joint-Based Action Progress Prediction.\n \n \n \n \n\n\n \n Pucci, D.; Becattini, F.; and Bimbo, A. D.\n\n\n \n\n\n\n Sensors, 23(1): 520. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"Joint-BasedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/sensors/PucciBB23,\n    author = "Pucci, Davide and Becattini, Federico and Bimbo, Alberto Del",\n    title = "Joint-Based Action Progress Prediction",\n    journal = "Sensors",\n    volume = "23",\n    number = "1",\n    pages = "520",\n    year = "2023",\n    url = "https://doi.org/10.3390/s23010520",\n    doi = "10.3390/S23010520",\n    timestamp = "Tue, 31 Jan 2023 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/sensors/PucciBB23.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Novel Memetic Strategy for Optimized Learning of Classification Trees.\n \n \n \n \n\n\n \n Aldinucci, T.\n\n\n \n\n\n\n CoRR, abs/2305.07959. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2305-07959,\n    author = "Aldinucci, Tommaso",\n    title = "A Novel Memetic Strategy for Optimized Learning of Classification Trees",\n    journal = "CoRR",\n    volume = "abs/2305.07959",\n    year = "2023",\n    url = "https://doi.org/10.48550/arXiv.2305.07959",\n    doi = "10.48550/ARXIV.2305.07959",\n    eprinttype = "arXiv",\n    eprint = "2305.07959",\n    timestamp = "Wed, 17 May 2023 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/corr/abs-2305-07959.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Lightweight and Effective Convolutional Neural Networks for Vehicle Viewpoint Estimation From Monocular Images.\n \n \n \n \n\n\n \n Magistri, S.; Boschi, M.; Sambo, F.; de Andrade, D. C.; Simoncini, M.; Kubin, L.; Taccari, L.; Luigi, L. D.; and Salti, S.\n\n\n \n\n\n\n IEEE Trans. Intell. Transp. Syst., 24(1): 191–200. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"LightweightPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/tits/MagistriBSASKTLS23,\n    author = "Magistri, Simone and Boschi, Marco and Sambo, Francesco and de Andrade, Douglas Coimbra and Simoncini, Matteo and Kubin, Luca and Taccari, Leonardo and Luigi, Luca De and Salti, Samuele",\n    title = "Lightweight and Effective Convolutional Neural Networks for Vehicle Viewpoint Estimation From Monocular Images",\n    journal = "{IEEE} Trans. Intell. Transp. Syst.",\n    volume = "24",\n    number = "1",\n    pages = "191--200",\n    year = "2023",\n    url = "https://doi.org/10.1109/TITS.2022.3216359",\n    doi = "10.1109/TITS.2022.3216359",\n    timestamp = "Fri, 10 Feb 2023 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/tits/MagistriBSASKTLS23.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Towards Continual Social Network Identification.\n \n \n \n \n\n\n \n Magistri, S.; Baracchi, D.; Shullani, D.; Bagdanov, A. D.; and Piva, A.\n\n\n \n\n\n\n In 11th International Workshop on Biometrics and Forensics, IWBF 2023, Barcelona, Spain, April 19-20, 2023, pages 1–6, 2023. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"TowardsPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/iwbf/MagistriBSBP23,\n    author = "Magistri, Simone and Baracchi, Daniele and Shullani, Dasara and Bagdanov, Andrew D. and Piva, Alessandro",\n    title = "Towards Continual Social Network Identification",\n    booktitle = "11th International Workshop on Biometrics and Forensics, {IWBF} 2023, Barcelona, Spain, April 19-20, 2023",\n    pages = "1--6",\n    publisher = "{IEEE}",\n    year = "2023",\n    url = "https://doi.org/10.1109/IWBF57495.2023.10157835",\n    doi = "10.1109/IWBF57495.2023.10157835",\n    timestamp = "Tue, 07 May 2024 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/conf/iwbf/MagistriBSBP23.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2022\n \n \n (11)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Minimization over the \\(ℓ\\) \\(_\\mbox1\\)-ball using an active-set non-monotone projected gradient.\n \n \n \n \n\n\n \n Cristofari, A.; Santis, M. D.; Lucidi, S.; and Rinaldi, F.\n\n\n \n\n\n\n Comput. Optim. Appl., 83(2): 693–721. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"MinimizationPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/coap/CristofariSLR22,\n    author = "Cristofari, Andrea and Santis, Marianna De and Lucidi, Stefano and Rinaldi, Francesco",\n    title = "Minimization over the {\\(\\mathscr{l}\\)} \\({}\\_{\\mbox{1}}\\)-ball using an active-set non-monotone projected gradient",\n    journal = "Comput. Optim. Appl.",\n    volume = "83",\n    number = "2",\n    pages = "693--721",\n    year = "2022",\n    url = "https://doi.org/10.1007/s10589-022-00407-6",\n    doi = "10.1007/S10589-022-00407-6",\n    timestamp = "Mon, 28 Aug 2023 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/coap/CristofariSLR22.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems.\n \n \n \n \n\n\n \n Santis, M. D.; de Vries, S.; Schmidt, M.; and Winkel, L.\n\n\n \n\n\n\n INFORMS J. Comput., 34(6): 3117–3133. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/informs/SantisV0W22,\n    author = "Santis, Marianna De and de Vries, Sven and Schmidt, Martin and Winkel, Lukas",\n    title = "A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems",\n    journal = "{INFORMS} J. Comput.",\n    volume = "34",\n    number = "6",\n    pages = "3117--3133",\n    year = "2022",\n    url = "https://doi.org/10.1287/ijoc.2022.1216",\n    doi = "10.1287/IJOC.2022.1216",\n    timestamp = "Thu, 13 Jun 2024 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/informs/SantisV0W22.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the exactness of the \\emph\\(ε\\)-constraint method for biobjective nonlinear integer programming.\n \n \n \n \n\n\n \n Santis, M. D.; Eichfelder, G.; and Patria, D.\n\n\n \n\n\n\n Oper. Res. Lett., 50(3): 356–361. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/orl/SantisEP22,\n    author = "Santis, Marianna De and Eichfelder, Gabriele and Patria, Daniele",\n    title = "On the exactness of the \\emph{{\\(\\epsilon\\)}}-constraint method for biobjective nonlinear integer programming",\n    journal = "Oper. Res. Lett.",\n    volume = "50",\n    number = "3",\n    pages = "356--361",\n    year = "2022",\n    url = "https://doi.org/10.1016/j.orl.2022.04.007",\n    doi = "10.1016/J.ORL.2022.04.007",\n    timestamp = "Wed, 29 Jun 2022 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/orl/SantisEP22.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An experimental study on latency-aware and self-adaptive service chaining orchestration in distributed NFV and SDN infrastructures.\n \n \n \n \n\n\n \n Gharbaoui, M.; Contoli, C.; Davoli, G.; Borsatti, D.; Cuffaro, G.; Paganelli, F.; Cerroni, W.; Cappanera, P.; and Martini, B.\n\n\n \n\n\n\n Comput. Networks, 208: 108880. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/cn/GharbaouiCDBCPC22,\n    author = "Gharbaoui, Molka and Contoli, Chiara and Davoli, Gianluca and Borsatti, Davide and Cuffaro, Giovanni and Paganelli, Federica and Cerroni, Walter and Cappanera, Paola and Martini, Barbara",\n    title = "An experimental study on latency-aware and self-adaptive service chaining orchestration in distributed {NFV} and {SDN} infrastructures",\n    journal = "Comput. Networks",\n    volume = "208",\n    pages = "108880",\n    year = "2022",\n    url = "https://doi.org/10.1016/j.comnet.2022.108880",\n    doi = "10.1016/J.COMNET.2022.108880",\n    timestamp = "Mon, 01 May 2023 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/cn/GharbaouiCDBCPC22.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n PROASSIST4.0: An Optimized Tele-Assistance System for the Future Healthcare.\n \n \n \n \n\n\n \n Mucchi, L.; Jayousi, S.; Cappanera, P.; Visintin, F.; Zoppi, P.; Paoletti, E.; Geli, S.; Dionisio, P.; Tamburini, E.; and Paggetti, C.\n\n\n \n\n\n\n In 16th IEEE International Symposium on Medical Information and Communication Technology, ISMICT 2022, Lincoln, NE, USA, May 2-4, 2022, pages 1–5, 2022. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"PROASSIST4.0:Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/ismict/MucchiJCVZPGDTP22,\n    author = "Mucchi, Lorenzo and Jayousi, Sara and Cappanera, Paola and Visintin, Filippo and Zoppi, Paolo and Paoletti, Elisabetta and Geli, Simona and Dionisio, Pietro and Tamburini, Elena and Paggetti, Cristiano",\n    title = "{PROASSIST4.0:} An Optimized Tele-Assistance System for the Future Healthcare",\n    booktitle = "16th {IEEE} International Symposium on Medical Information and Communication Technology, {ISMICT} 2022, Lincoln, NE, USA, May 2-4, 2022",\n    pages = "1--5",\n    publisher = "{IEEE}",\n    year = "2022",\n    url = "https://doi.org/10.1109/ISMICT56646.2022.9828045",\n    doi = "10.1109/ISMICT56646.2022.9828045",\n    timestamp = "Sun, 02 Oct 2022 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/conf/ismict/MucchiJCVZPGDTP22.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Discrete 2-convex functions.\n \n \n \n \n\n\n \n Fujishige, S.; and Tardella, F.\n\n\n \n\n\n\n Math. Program., 195(1): 831–854. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"DiscretePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/mp/FujishigeT22,\n    author = "Fujishige, Satoru and Tardella, Fabio",\n    title = "Discrete 2-convex functions",\n    journal = "Math. Program.",\n    volume = "195",\n    number = "1",\n    pages = "831--854",\n    year = "2022",\n    url = "https://doi.org/10.1007/s10107-021-01717-z",\n    doi = "10.1007/S10107-021-01717-Z",\n    timestamp = "Sun, 13 Nov 2022 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/mp/FujishigeT22.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A study on sequential minimal optimization methods for standard quadratic problems.\n \n \n \n \n\n\n \n Bisori, R.; Lapucci, M.; and Sciandrone, M.\n\n\n \n\n\n\n 4OR, 20(4): 685–712. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/4or/BisoriLS22,\n    author = "Bisori, Riccardo and Lapucci, Matteo and Sciandrone, Marco",\n    title = "A study on sequential minimal optimization methods for standard quadratic problems",\n    journal = "4OR",\n    volume = "20",\n    number = "4",\n    pages = "685--712",\n    year = "2022",\n    url = "https://doi.org/10.1007/s10288-021-00496-9",\n    doi = "10.1007/S10288-021-00496-9",\n    timestamp = "Mon, 05 Dec 2022 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/4or/BisoriLS22.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A penalty decomposition approach for multi-objective cardinality-constrained optimization problems.\n \n \n \n \n\n\n \n Lapucci, M.\n\n\n \n\n\n\n Optim. Methods Softw., 37(6): 2157–2189. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/oms/Lapucci22,\n    author = "Lapucci, Matteo",\n    title = "A penalty decomposition approach for multi-objective cardinality-constrained optimization problems",\n    journal = "Optim. Methods Softw.",\n    volume = "37",\n    number = "6",\n    pages = "2157--2189",\n    year = "2022",\n    url = "https://doi.org/10.1080/10556788.2022.2060972",\n    doi = "10.1080/10556788.2022.2060972",\n    timestamp = "Sun, 15 Jan 2023 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/oms/Lapucci22.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Contextual Decision Trees.\n \n \n \n \n\n\n \n Aldinucci, T.; Civitelli, E.; Gangi, L. D.; and Sestini, A.\n\n\n \n\n\n\n CoRR, abs/2207.06355. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"ContextualPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2207-06355,\n    author = "Aldinucci, Tommaso and Civitelli, Enrico and Gangi, Leonardo Di and Sestini, Alessandro",\n    title = "Contextual Decision Trees",\n    journal = "CoRR",\n    volume = "abs/2207.06355",\n    year = "2022",\n    url = "https://doi.org/10.48550/arXiv.2207.06355",\n    doi = "10.48550/ARXIV.2207.06355",\n    eprinttype = "arXiv",\n    eprint = "2207.06355",\n    timestamp = "Tue, 19 Jul 2022 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/corr/abs-2207-06355.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Impact of chaotic dynamics on the performance of metaheuristic optimization algorithms: An experimental analysis.\n \n \n \n \n\n\n \n Zelinka, I.; Diep, Q. B.; Snásel, V.; Das, S.; Innocenti, G.; Tesi, A.; Schoen, F.; and Kuznetsov, N. V.\n\n\n \n\n\n\n Inf. Sci., 587: 692–719. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"ImpactPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/isci/ZelinkaDSDITSK22,\n    author = "Zelinka, Ivan and Diep, Quoc Bao and Sn{\\'{a}}sel, V{\\'{a}}clav and Das, Swagatam and Innocenti, Giacomo and Tesi, Alberto and Schoen, Fabio and Kuznetsov, Nikolay V.",\n    title = "Impact of chaotic dynamics on the performance of metaheuristic optimization algorithms: An experimental analysis",\n    journal = "Inf. Sci.",\n    volume = "587",\n    pages = "692--719",\n    year = "2022",\n    url = "https://doi.org/10.1016/j.ins.2021.10.076",\n    doi = "10.1016/J.INS.2021.10.076",\n    timestamp = "Fri, 13 May 2022 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/isci/ZelinkaDSDITSK22.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Unsafe Maneuver Classification From Dashcam Video and GPS/IMU Sensors Using Spatio-Temporal Attention Selector.\n \n \n \n \n\n\n \n Simoncini, M.; de Andrade, D. C.; Taccari, L.; Salti, S.; Kubin, L.; Schoen, F.; and Sambo, F.\n\n\n \n\n\n\n IEEE Trans. Intell. Transp. Syst., 23(9): 15605–15615. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"UnsafePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/tits/SimonciniATSKSS22,\n    author = "Simoncini, Matteo and de Andrade, Douglas Coimbra and Taccari, Leonardo and Salti, Samuele and Kubin, Luca and Schoen, Fabio and Sambo, Francesco",\n    title = "Unsafe Maneuver Classification From Dashcam Video and {GPS/IMU} Sensors Using Spatio-Temporal Attention Selector",\n    journal = "{IEEE} Trans. Intell. Transp. Syst.",\n    volume = "23",\n    number = "9",\n    pages = "15605--15615",\n    year = "2022",\n    url = "https://doi.org/10.1109/TITS.2022.3142672",\n    doi = "10.1109/TITS.2022.3142672",\n    timestamp = "Tue, 18 Oct 2022 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/tits/SimonciniATSKSS22.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (16)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Improving ADMMs for solving doubly nonnegative programs through dual factorization.\n \n \n \n \n\n\n \n Cerulli, M.; Santis, M. D.; Gaar, E.; and Wiegele, A.\n\n\n \n\n\n\n 4OR, 19(3): 415–448. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"ImprovingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/4or/CerulliSGW21,\n    author = "Cerulli, Martina and Santis, Marianna De and Gaar, Elisabeth and Wiegele, Angelika",\n    title = "Improving ADMMs for solving doubly nonnegative programs through dual factorization",\n    journal = "4OR",\n    volume = "19",\n    number = "3",\n    pages = "415--448",\n    year = "2021",\n    url = "https://doi.org/10.1007/s10288-020-00454-x",\n    doi = "10.1007/S10288-020-00454-X",\n    timestamp = "Sun, 02 Oct 2022 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/4or/CerulliSGW21.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective.\n \n \n \n \n\n\n \n Conforti, M.; Santis, M. D.; Summa, M. D.; and Rinaldi, F.\n\n\n \n\n\n\n 4OR, 19(4): 531–548. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"ScanningPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/4or/ConfortiSSR21,\n    author = "Conforti, Michele and Santis, Marianna De and Summa, Marco Di and Rinaldi, Francesco",\n    title = "Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective",\n    journal = "4OR",\n    volume = "19",\n    number = "4",\n    pages = "531--548",\n    year = "2021",\n    url = "https://doi.org/10.1007/s10288-020-00459-6",\n    doi = "10.1007/S10288-020-00459-6",\n    timestamp = "Wed, 01 Nov 2023 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/4or/ConfortiSSR21.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A decision space algorithm for multiobjective convex quadratic integer optimization.\n \n \n \n \n\n\n \n Santis, M. D.; and Eichfelder, G.\n\n\n \n\n\n\n Comput. Oper. Res., 134: 105396. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/cor/SantisE21,\n    author = "Santis, Marianna De and Eichfelder, Gabriele",\n    title = "A decision space algorithm for multiobjective convex quadratic integer optimization",\n    journal = "Comput. Oper. Res.",\n    volume = "134",\n    pages = "105396",\n    year = "2021",\n    url = "https://doi.org/10.1016/j.cor.2021.105396",\n    doi = "10.1016/J.COR.2021.105396",\n    timestamp = "Fri, 23 Jul 2021 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/cor/SantisE21.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Design of a wearable device for physiological parameter monitoring in a COVID setting.\n \n \n \n \n\n\n \n Santis, M. D.; Barcali, E.; Bardacci, Y.; Rasero, L.; Bambi, S.; and Bocchi, L.\n\n\n \n\n\n\n In 43rd Annual International Conference of the IEEE Engineering in Medicine \\& Biology Society, EMBC 2021, Mexico, November 1-5, 2021, pages 7352–7355, 2021. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"DesignPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/embc/SantisBBRBB21,\n    author = "Santis, Marianna De and Barcali, Eleonora and Bardacci, Y. and Rasero, L. and Bambi, Stefano and Bocchi, Leonardo",\n    title = "Design of a wearable device for physiological parameter monitoring in a {COVID} setting",\n    booktitle = "43rd Annual International Conference of the {IEEE} Engineering in Medicine {\\\\&} Biology Society, {EMBC} 2021, Mexico, November 1-5, 2021",\n    pages = "7352--7355",\n    publisher = "{IEEE}",\n    year = "2021",\n    url = "https://doi.org/10.1109/EMBC46164.2021.9630379",\n    doi = "10.1109/EMBC46164.2021.9630379",\n    timestamp = "Tue, 05 Aug 2025 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/conf/embc/SantisBBRBB21.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Tenant-defined service function chaining in a multi-site network slice.\n \n \n \n \n\n\n \n Paganelli, F.; Cappanera, P.; and Cuffaro, G.\n\n\n \n\n\n\n Future Gener. Comput. Syst., 121: 1–18. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"Tenant-definedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/fgcs/PaganelliCC21,\n    author = "Paganelli, Federica and Cappanera, Paola and Cuffaro, Giovanni",\n    title = "Tenant-defined service function chaining in a multi-site network slice",\n    journal = "Future Gener. Comput. Syst.",\n    volume = "121",\n    pages = "1--18",\n    year = "2021",\n    url = "https://doi.org/10.1016/j.future.2021.03.002",\n    doi = "10.1016/J.FUTURE.2021.03.002",\n    timestamp = "Mon, 26 Jun 2023 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/fgcs/PaganelliCC21.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Profit-aware placement of multi-flavoured VNF chains.\n \n \n \n \n\n\n \n Paganelli, F.; Cappanera, P.; Brogi, A.; and Falco, R.\n\n\n \n\n\n\n In 10th IEEE International Conference on Cloud Networking, CloudNet 2021, Cookeville, TN, USA, November 8-10, 2021, pages 48–55, 2021. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"Profit-awarePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/cloudnet/PaganelliCBF21,\n    author = "Paganelli, Federica and Cappanera, Paola and Brogi, Antonio and Falco, Riccardo",\n    title = "Profit-aware placement of multi-flavoured {VNF} chains",\n    booktitle = "10th {IEEE} International Conference on Cloud Networking, CloudNet 2021, Cookeville, TN, USA, November 8-10, 2021",\n    pages = "48--55",\n    publisher = "{IEEE}",\n    year = "2021",\n    url = "https://doi.org/10.1109/CloudNet53349.2021.9657114",\n    doi = "10.1109/CLOUDNET53349.2021.9657114",\n    timestamp = "Sun, 04 Aug 2024 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/conf/cloudnet/PaganelliCBF21.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Risk parity with expectiles.\n \n \n \n \n\n\n \n Bellini, F.; Cesarone, F.; Colombo, C.; and Tardella, F.\n\n\n \n\n\n\n Eur. J. Oper. Res., 291(3): 1149–1163. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"RiskPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/eor/BelliniCCT21,\n    author = "Bellini, Fabio and Cesarone, Francesco and Colombo, Christian and Tardella, Fabio",\n    title = "Risk parity with expectiles",\n    journal = "Eur. J. Oper. Res.",\n    volume = "291",\n    number = "3",\n    pages = "1149--1163",\n    year = "2021",\n    url = "https://doi.org/10.1016/j.ejor.2020.10.009",\n    doi = "10.1016/J.EJOR.2020.10.009",\n    timestamp = "Sat, 30 Sep 2023 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/eor/BelliniCCT21.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An effective procedure for feature subset selection in logistic regression based on information criteria.\n \n \n \n \n\n\n \n Civitelli, E.; Lapucci, M.; Schoen, F.; and Sortino, A.\n\n\n \n\n\n\n Comput. Optim. Appl., 80(1): 1–32. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/coap/CivitelliLSS21,\n    author = "Civitelli, Enrico and Lapucci, Matteo and Schoen, Fabio and Sortino, Alessio",\n    title = "An effective procedure for feature subset selection in logistic regression based on information criteria",\n    journal = "Comput. Optim. Appl.",\n    volume = "80",\n    number = "1",\n    pages = "1--32",\n    year = "2021",\n    url = "https://doi.org/10.1007/s10589-021-00288-1",\n    doi = "10.1007/S10589-021-00288-1",\n    timestamp = "Mon, 09 Dec 2024 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/coap/CivitelliLSS21.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Pareto front approximation through a multi-objective augmented Lagrangian method.\n \n \n \n \n\n\n \n Cocchi, G.; Lapucci, M.; and Mansueto, P.\n\n\n \n\n\n\n EURO J. Comput. Optim., 9: 100008. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"ParetoPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/ejco/CocchiLM21,\n    author = "Cocchi, Guido and Lapucci, Matteo and Mansueto, Pierluigi",\n    title = "Pareto front approximation through a multi-objective augmented Lagrangian method",\n    journal = "{EURO} J. Comput. Optim.",\n    volume = "9",\n    pages = "100008",\n    year = "2021",\n    url = "https://doi.org/10.1016/j.ejco.2021.100008",\n    doi = "10.1016/J.EJCO.2021.100008",\n    timestamp = "Sun, 02 Nov 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/ejco/CocchiLM21.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Two-Level Decomposition Framework Exploiting First and Second Order Information for SVM Training Problems.\n \n \n \n \n\n\n \n Galvan, G.; Lapucci, M.; Lin, C.; and Sciandrone, M.\n\n\n \n\n\n\n J. Mach. Learn. Res., 22: 23:1–23:38. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jmlr/GalvanLLS21,\n    author = "Galvan, Giulio and Lapucci, Matteo and Lin, Chih{-}Jen and Sciandrone, Marco",\n    title = "A Two-Level Decomposition Framework Exploiting First and Second Order Information for {SVM} Training Problems",\n    journal = "J. Mach. Learn. Res.",\n    volume = "22",\n    pages = "23:1--23:38",\n    year = "2021",\n    url = "https://jmlr.org/papers/v22/19-632.html",\n    timestamp = "Wed, 11 Sep 2024 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/jmlr/GalvanLLS21.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Convergent Inexact Penalty Decomposition Methods for Cardinality-Constrained Problems.\n \n \n \n \n\n\n \n Lapucci, M.; Levato, T.; and Sciandrone, M.\n\n\n \n\n\n\n J. Optim. Theory Appl., 188(2): 473–496. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"ConvergentPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jota/LapucciLS21,\n    author = "Lapucci, Matteo and Levato, Tommaso and Sciandrone, Marco",\n    title = "Convergent Inexact Penalty Decomposition Methods for Cardinality-Constrained Problems",\n    journal = "J. Optim. Theory Appl.",\n    volume = "188",\n    number = "2",\n    pages = "473--496",\n    year = "2021",\n    url = "https://doi.org/10.1007/s10957-020-01793-9",\n    doi = "10.1007/S10957-020-01793-9",\n    timestamp = "Fri, 14 May 2021 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/jota/LapucciLS21.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Robust Initialization of Residual Blocks for Effective ResNet Training without Batch Normalization.\n \n \n \n \n\n\n \n Civitelli, E.; Sortino, A.; Lapucci, M.; Bagattini, F.; and Galvan, G.\n\n\n \n\n\n\n CoRR, abs/2112.12299. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2112-12299,\n    author = "Civitelli, Enrico and Sortino, Alessio and Lapucci, Matteo and Bagattini, Francesco and Galvan, Giulio",\n    title = "A Robust Initialization of Residual Blocks for Effective ResNet Training without Batch Normalization",\n    journal = "CoRR",\n    volume = "abs/2112.12299",\n    year = "2021",\n    url = "https://arxiv.org/abs/2112.12299",\n    eprinttype = "arXiv",\n    eprint = "2112.12299",\n    timestamp = "Tue, 04 Jan 2022 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/corr/abs-2112-12299.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Memetic differential evolution methods for clustering problems.\n \n \n \n \n\n\n \n Mansueto, P.; and Schoen, F.\n\n\n \n\n\n\n Pattern Recognit., 114: 107849. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"MemeticPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/pr/MansuetoS21,\n    author = "Mansueto, Pierluigi and Schoen, Fabio",\n    title = "Memetic differential evolution methods for clustering problems",\n    journal = "Pattern Recognit.",\n    volume = "114",\n    pages = "107849",\n    year = "2021",\n    url = "https://doi.org/10.1016/j.patcog.2021.107849",\n    doi = "10.1016/J.PATCOG.2021.107849",\n    timestamp = "Wed, 07 Apr 2021 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/pr/MansuetoS21.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Efficient large scale global optimization through clustering-based population methods.\n \n \n \n \n\n\n \n Schoen, F.; and Tigli, L.\n\n\n \n\n\n\n Comput. Oper. Res., 127: 105165. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"EfficientPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/cor/SchoenT21,\n    author = "Schoen, Fabio and Tigli, Luca",\n    title = "Efficient large scale global optimization through clustering-based population methods",\n    journal = "Comput. Oper. Res.",\n    volume = "127",\n    pages = "105165",\n    year = "2021",\n    url = "https://doi.org/10.1016/j.cor.2020.105165",\n    doi = "10.1016/J.COR.2020.105165",\n    timestamp = "Fri, 09 Apr 2021 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/cor/SchoenT21.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n (Global) Optimization: Historical notes and recent developments.\n \n \n \n \n\n\n \n Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n EURO J. Comput. Optim., 9: 100012. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"(Global)Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/ejco/LocatelliS21,\n    author = "Locatelli, Marco and Schoen, Fabio",\n    title = "(Global) Optimization: Historical notes and recent developments",\n    journal = "{EURO} J. Comput. Optim.",\n    volume = "9",\n    pages = "100012",\n    year = "2021",\n    url = "https://doi.org/10.1016/j.ejco.2021.100012",\n    doi = "10.1016/J.EJCO.2021.100012",\n    timestamp = "Wed, 27 Jul 2022 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/ejco/LocatelliS21.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Prescriptive analytics for inventory management in health care.\n \n \n \n \n\n\n \n Galli, L.; Levato, T.; Schoen, F.; and Tigli, L.\n\n\n \n\n\n\n J. Oper. Res. Soc., 72(10): 2211–2224. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"PrescriptivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jors/GalliLST21,\n    author = "Galli, Leonardo and Levato, Tommaso and Schoen, Fabio and Tigli, Luca",\n    title = "Prescriptive analytics for inventory management in health care",\n    journal = "J. Oper. Res. Soc.",\n    volume = "72",\n    number = "10",\n    pages = "2211--2224",\n    year = "2021",\n    url = "https://doi.org/10.1080/01605682.2020.1776167",\n    doi = "10.1080/01605682.2020.1776167",\n    timestamp = "Wed, 15 Dec 2021 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/jors/GalliLST21.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (11)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n An active-set algorithmic framework for non-convex optimization problems over the simplex.\n \n \n \n \n\n\n \n Cristofari, A.; Santis, M. D.; Lucidi, S.; and Rinaldi, F.\n\n\n \n\n\n\n Comput. Optim. Appl., 77(1): 57–89. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/coap/CristofariSLR20,\n    author = "Cristofari, Andrea and Santis, Marianna De and Lucidi, Stefano and Rinaldi, Francesco",\n    title = "An active-set algorithmic framework for non-convex optimization problems over the simplex",\n    journal = "Comput. Optim. Appl.",\n    volume = "77",\n    number = "1",\n    pages = "57--89",\n    year = "2020",\n    url = "https://doi.org/10.1007/s10589-020-00195-x",\n    doi = "10.1007/S10589-020-00195-X",\n    timestamp = "Tue, 29 Dec 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/coap/CristofariSLR20.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming.\n \n \n \n \n\n\n \n Santis, M. D.; Grani, G.; and Palagi, L.\n\n\n \n\n\n\n Eur. J. Oper. Res., 283(1): 57–69. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"BranchingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/eor/SantisGP20,\n    author = "Santis, Marianna De and Grani, Giorgio and Palagi, Laura",\n    title = "Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming",\n    journal = "Eur. J. Oper. Res.",\n    volume = "283",\n    number = "1",\n    pages = "57--69",\n    year = "2020",\n    url = "https://doi.org/10.1016/j.ejor.2019.10.034",\n    doi = "10.1016/J.EJOR.2019.10.034",\n    timestamp = "Sun, 19 Jan 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/eor/SantisGP20.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Solving Multiobjective Mixed Integer Convex Optimization Problems.\n \n \n \n \n\n\n \n Santis, M. D.; Eichfelder, G.; Niebling, J.; and Rocktäschel, S.\n\n\n \n\n\n\n SIAM J. Optim., 30(4): 3122–3145. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"SolvingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/siamjo/SantisENR20,\n    author = {Santis, Marianna De and Eichfelder, Gabriele and Niebling, Julia and Rockt{\\"{a}}schel, Stefan},\n    title = "Solving Multiobjective Mixed Integer Convex Optimization Problems",\n    journal = "{SIAM} J. Optim.",\n    volume = "30",\n    number = "4",\n    pages = "3122--3145",\n    year = "2020",\n    url = "https://doi.org/10.1137/19M1264709",\n    doi = "10.1137/19M1264709",\n    timestamp = "Fri, 09 Apr 2021 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/siamjo/SantisENR20.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Temporal constraints and device management for the Skill VRP: Mathematical model and lower bounding techniques.\n \n \n \n \n\n\n \n Cappanera, P.; Requejo, C.; and Scutellà, M. G.\n\n\n \n\n\n\n Comput. Oper. Res., 124: 105054. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"TemporalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/cor/CappaneraRS20,\n    author = "Cappanera, Paola and Requejo, Cristina and Scutell{\\`{a}}, Maria Grazia",\n    title = "Temporal constraints and device management for the Skill {VRP:} Mathematical model and lower bounding techniques",\n    journal = "Comput. Oper. Res.",\n    volume = "124",\n    pages = "105054",\n    year = "2020",\n    url = "https://doi.org/10.1016/j.cor.2020.105054",\n    doi = "10.1016/J.COR.2020.105054",\n    timestamp = "Mon, 26 Oct 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/cor/CappaneraRS20.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An optimization-diversification approach to portfolio selection.\n \n \n \n \n\n\n \n Cesarone, F.; Scozzari, A.; and Tardella, F.\n\n\n \n\n\n\n J. Glob. Optim., 76(2): 245–265. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jgo/CesaroneST20,\n    author = "Cesarone, Francesco and Scozzari, Andrea and Tardella, Fabio",\n    title = "An optimization-diversification approach to portfolio selection",\n    journal = "J. Glob. Optim.",\n    volume = "76",\n    number = "2",\n    pages = "245--265",\n    year = "2020",\n    url = "https://doi.org/10.1007/s10898-019-00809-7",\n    doi = "10.1007/S10898-019-00809-7",\n    timestamp = "Fri, 11 Sep 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/jgo/CesaroneST20.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Discrete Midpoint Convexity.\n \n \n \n \n\n\n \n Moriguchi, S.; Murota, K.; Tamura, A.; and Tardella, F.\n\n\n \n\n\n\n Math. Oper. Res., 45(1): 99–128. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"DiscretePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/mor/MoriguchiMTT20,\n    author = "Moriguchi, Satoko and Murota, Kazuo and Tamura, Akihisa and Tardella, Fabio",\n    title = "Discrete Midpoint Convexity",\n    journal = "Math. Oper. Res.",\n    volume = "45",\n    number = "1",\n    pages = "99--128",\n    year = "2020",\n    url = "https://doi.org/10.1287/moor.2018.0984",\n    doi = "10.1287/MOOR.2018.0984",\n    timestamp = "Sun, 19 Jan 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/mor/MoriguchiMTT20.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An augmented Lagrangian algorithm for multi-objective optimization.\n \n \n \n \n\n\n \n Cocchi, G.; and Lapucci, M.\n\n\n \n\n\n\n Comput. Optim. Appl., 77(1): 29–56. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/coap/CocchiL20,\n    author = "Cocchi, Guido and Lapucci, Matteo",\n    title = "An augmented Lagrangian algorithm for multi-objective optimization",\n    journal = "Comput. Optim. Appl.",\n    volume = "77",\n    number = "1",\n    pages = "29--56",\n    year = "2020",\n    url = "https://doi.org/10.1007/s10589-020-00204-z",\n    doi = "10.1007/S10589-020-00204-Z",\n    timestamp = "Thu, 06 Aug 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/coap/CocchiL20.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Alternating Augmented Lagrangian method for constrained nonconvex optimization.\n \n \n \n \n\n\n \n Galvan, G.; Lapucci, M.; Levato, T.; and Sciandrone, M.\n\n\n \n\n\n\n Optim. Methods Softw., 35(3): 502–520. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/oms/GalvanLLS20,\n    author = "Galvan, Giulio and Lapucci, Matteo and Levato, Tommaso and Sciandrone, Marco",\n    title = "An Alternating Augmented Lagrangian method for constrained nonconvex optimization",\n    journal = "Optim. Methods Softw.",\n    volume = "35",\n    number = "3",\n    pages = "502--520",\n    year = "2020",\n    url = "https://doi.org/10.1080/10556788.2019.1576177",\n    doi = "10.1080/10556788.2019.1576177",\n    timestamp = "Thu, 16 Sep 2021 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/oms/GalvanLLS20.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Recognition of Concordances for Indexing in Digital Libraries.\n \n \n \n \n\n\n \n Marinai, S.; Capobianco, S.; Ziran, Z.; Giuntini, A.; and Mansueto, P.\n\n\n \n\n\n\n In Ceci, M.; Ferilli, S.; and Poggi, A., editor(s), Digital Libraries: The Era of Big Data and Data Science - 16th Italian Research Conference on Digital Libraries, IRCDL 2020, Bari, Italy, January 30-31, 2020, Proceedings, volume 1177, of Communications in Computer and Information Science, pages 135–147, 2020. Springer\n \n\n\n\n
\n\n\n\n \n \n \"RecognitionPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/ircdl/MarinaiCZGM20,\n    author = "Marinai, Simone and Capobianco, Samuele and Ziran, Zahra and Giuntini, Andrea and Mansueto, Pierluigi",\n    editor = "Ceci, Michelangelo and Ferilli, Stefano and Poggi, Antonella",\n    title = "Recognition of Concordances for Indexing in Digital Libraries",\n    booktitle = "Digital Libraries: The Era of Big Data and Data Science - 16th Italian Research Conference on Digital Libraries, {IRCDL} 2020, Bari, Italy, January 30-31, 2020, Proceedings",\n    series = "Communications in Computer and Information Science",\n    volume = "1177",\n    pages = "135--147",\n    publisher = "Springer",\n    year = "2020",\n    url = "https://doi.org/10.1007/978-3-030-39905-4\\\\_14",\n    doi = "10.1007/978-3-030-39905-4\\\\_14",\n    timestamp = "Fri, 09 Apr 2021 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/conf/ircdl/MarinaiCZGM20.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Lightweight Deep Learning Model for Vehicle Viewpoint Estimation from Dashcam Images.\n \n \n \n \n\n\n \n Magistri, S.; Sambo, F.; Schoen, F.; de Andrade, D. C.; Simoncini, M.; Caprasecca, S.; Kubin, L.; Bravi, L.; and Taccari, L.\n\n\n \n\n\n\n In 23rd IEEE International Conference on Intelligent Transportation Systems, ITSC 2020, Rhodes, Greece, September 20-23, 2020, pages 1–6, 2020. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/itsc/MagistriSSASCKB20,\n    author = "Magistri, Simone and Sambo, Francesco and Schoen, Fabio and de Andrade, Douglas Coimbra and Simoncini, Matteo and Caprasecca, Stefano and Kubin, Luca and Bravi, Luca and Taccari, Leonardo",\n    title = "A Lightweight Deep Learning Model for Vehicle Viewpoint Estimation from Dashcam Images",\n    booktitle = "23rd {IEEE} International Conference on Intelligent Transportation Systems, {ITSC} 2020, Rhodes, Greece, September 20-23, 2020",\n    pages = "1--6",\n    publisher = "{IEEE}",\n    year = "2020",\n    url = "https://doi.org/10.1109/ITSC45102.2020.9294672",\n    doi = "10.1109/ITSC45102.2020.9294672",\n    timestamp = "Thu, 14 Oct 2021 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/conf/itsc/MagistriSSASCKB20.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Two-stream neural architecture for unsafe maneuvers classification from dashcam videos and GPS/IMU sensors.\n \n \n \n \n\n\n \n Simoncini, M.; de Andrade, D. C.; Salti, S.; Taccari, L.; Schoen, F.; and Sambo, F.\n\n\n \n\n\n\n In 23rd IEEE International Conference on Intelligent Transportation Systems, ITSC 2020, Rhodes, Greece, September 20-23, 2020, pages 1–6, 2020. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"Two-streamPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/itsc/SimonciniASTSS20,\n    author = "Simoncini, Matteo and de Andrade, Douglas Coimbra and Salti, Samuele and Taccari, Leonardo and Schoen, Fabio and Sambo, Francesco",\n    title = "Two-stream neural architecture for unsafe maneuvers classification from dashcam videos and {GPS/IMU} sensors",\n    booktitle = "23rd {IEEE} International Conference on Intelligent Transportation Systems, {ITSC} 2020, Rhodes, Greece, September 20-23, 2020",\n    pages = "1--6",\n    publisher = "{IEEE}",\n    year = "2020",\n    url = "https://doi.org/10.1109/ITSC45102.2020.9294189",\n    doi = "10.1109/ITSC45102.2020.9294189",\n    timestamp = "Thu, 14 Oct 2021 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/conf/itsc/SimonciniASTSS20.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (8)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n An active set algorithm for robust combinatorial optimization based on separation oracles.\n \n \n \n \n\n\n \n Buchheim, C.; and Santis, M. D.\n\n\n \n\n\n\n Math. Program. Comput., 11(4): 755–789. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/mpc/BuchheimS19,\n    author = "Buchheim, Christoph and Santis, Marianna De",\n    title = "An active set algorithm for robust combinatorial optimization based on separation oracles",\n    journal = "Math. Program. Comput.",\n    volume = "11",\n    number = "4",\n    pages = "755--789",\n    year = "2019",\n    url = "https://doi.org/10.1007/s12532-019-00160-8",\n    doi = "10.1007/S12532-019-00160-8",\n    timestamp = "Mon, 03 Mar 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/mpc/BuchheimS19.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n VNF placement for service chaining in a distributed cloud environment with multiple stakeholders.\n \n \n \n \n\n\n \n Cappanera, P.; Paganelli, F.; and Paradiso, F.\n\n\n \n\n\n\n Comput. Commun., 133: 24–40. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"VNFPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/comcom/CappaneraPP19,\n    author = "Cappanera, Paola and Paganelli, Federica and Paradiso, Francesca",\n    title = "{VNF} placement for service chaining in a distributed cloud environment with multiple stakeholders",\n    journal = "Comput. Commun.",\n    volume = "133",\n    pages = "24--40",\n    year = "2019",\n    url = "https://doi.org/10.1016/j.comcom.2018.10.008",\n    doi = "10.1016/J.COMCOM.2018.10.008",\n    timestamp = "Sun, 19 Jan 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/comcom/CappaneraPP19.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Tenant-Side Management of Service Function Chaining: Architecture, Implementation and Experiment on a Future Internet Testbed.\n \n \n \n \n\n\n \n Cuffaro, G.; Paganelli, F.; and Cappanera, P.\n\n\n \n\n\n\n In Jacquenet, C.; Turck, F. D.; Chemouil, P.; Esposito, F.; Festor, O.; Cerroni, W.; and Secci, S., editor(s), 5th IEEE Conference on Network Softwarization, NetSoft 2019, Paris, France, June 24-28, 2019, pages 124–132, 2019. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"Tenant-SidePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/netsoft/CuffaroPC19,\n    author = "Cuffaro, Giovanni and Paganelli, Federica and Cappanera, Paola",\n    editor = "Jacquenet, Christian and Turck, Filip De and Chemouil, Prosper and Esposito, Flavio and Festor, Olivier and Cerroni, Walter and Secci, Stefano",\n    title = "Tenant-Side Management of Service Function Chaining: Architecture, Implementation and Experiment on a Future Internet Testbed",\n    booktitle = "5th {IEEE} Conference on Network Softwarization, NetSoft 2019, Paris, France, June 24-28, 2019",\n    pages = "124--132",\n    publisher = "{IEEE}",\n    year = "2019",\n    url = "https://doi.org/10.1109/NETSOFT.2019.8806702",\n    doi = "10.1109/NETSOFT.2019.8806702",\n    timestamp = "Fri, 09 Apr 2021 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/conf/netsoft/CuffaroPC19.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Scaling, proximity, and optimization of integrally convex functions.\n \n \n \n \n\n\n \n Moriguchi, S.; Murota, K.; Tamura, A.; and Tardella, F.\n\n\n \n\n\n\n Math. Program., 175(1-2): 119–154. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"Scaling,Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/mp/MoriguchiMTT19,\n    author = "Moriguchi, Satoko and Murota, Kazuo and Tamura, Akihisa and Tardella, Fabio",\n    title = "Scaling, proximity, and optimization of integrally convex functions",\n    journal = "Math. Program.",\n    volume = "175",\n    number = "1-2",\n    pages = "119--154",\n    year = "2019",\n    url = "https://doi.org/10.1007/s10107-018-1234-z",\n    doi = "10.1007/S10107-018-1234-Z",\n    timestamp = "Fri, 31 May 2019 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/mp/MoriguchiMTT19.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series.\n \n \n \n \n\n\n \n Gangi, L. D.; Lapucci, M.; Schoen, F.; and Sortino, A.\n\n\n \n\n\n\n Comput. Optim. Appl., 74(3): 919–948. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/coap/GangiLSS19,\n    author = "Gangi, Leonardo Di and Lapucci, Matteo and Schoen, Fabio and Sortino, Alessio",\n    title = "An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series",\n    journal = "Comput. Optim. Appl.",\n    volume = "74",\n    number = "3",\n    pages = "919--948",\n    year = "2019",\n    url = "https://doi.org/10.1007/s10589-019-00134-5",\n    doi = "10.1007/S10589-019-00134-5",\n    timestamp = "Sun, 19 Jan 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/coap/GangiLSS19.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the convergence of inexact augmented Lagrangian methods for problems with convex constraints.\n \n \n \n \n\n\n \n Galvan, G.; and Lapucci, M.\n\n\n \n\n\n\n Oper. Res. Lett., 47(3): 185–189. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/orl/GalvanL19,\n    author = "Galvan, Giulio and Lapucci, Matteo",\n    title = "On the convergence of inexact augmented Lagrangian methods for problems with convex constraints",\n    journal = "Oper. Res. Lett.",\n    volume = "47",\n    number = "3",\n    pages = "185--189",\n    year = "2019",\n    url = "https://doi.org/10.1016/j.orl.2019.03.006",\n    doi = "10.1016/J.ORL.2019.03.006",\n    timestamp = "Sun, 19 Jan 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/orl/GalvanL19.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Clustering methods for large scale geometrical global optimization.\n \n \n \n \n\n\n \n Bagattini, F.; Schoen, F.; and Tigli, L.\n\n\n \n\n\n\n Optim. Methods Softw., 34(5): 1099–1122. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"ClusteringPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/oms/BagattiniST19,\n    author = "Bagattini, Francesco and Schoen, Fabio and Tigli, Luca",\n    title = "Clustering methods for large scale geometrical global optimization",\n    journal = "Optim. Methods Softw.",\n    volume = "34",\n    number = "5",\n    pages = "1099--1122",\n    year = "2019",\n    url = "https://doi.org/10.1080/10556788.2019.1582651",\n    doi = "10.1080/10556788.2019.1582651",\n    timestamp = "Sun, 19 Jan 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/oms/BagattiniST19.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Light Footprint Driving Behaviour Classification.\n \n \n \n \n\n\n \n Pjetri, A.; Simoncini, M.; Sambo, F.; Lori, A.; and Schoen, F.\n\n\n \n\n\n\n In 2019 IEEE Intelligent Transportation Systems Conference, ITSC 2019, Auckland, New Zealand, October 27-30, 2019, pages 1186–1191, 2019. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"LightPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/itsc/PjetriSSLS19,\n    author = "Pjetri, Aurel and Simoncini, Matteo and Sambo, Francesco and Lori, Alessandro and Schoen, Fabio",\n    title = "Light Footprint Driving Behaviour Classification",\n    booktitle = "2019 {IEEE} Intelligent Transportation Systems Conference, {ITSC} 2019, Auckland, New Zealand, October 27-30, 2019",\n    pages = "1186--1191",\n    publisher = "{IEEE}",\n    year = "2019",\n    url = "https://doi.org/10.1109/ITSC.2019.8917157",\n    doi = "10.1109/ITSC.2019.8917157",\n    timestamp = "Sun, 06 Oct 2024 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/conf/itsc/PjetriSSLS19.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (10)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization.\n \n \n \n \n\n\n \n Buchheim, C.; Santis, M. D.; Rinaldi, F.; and Trieu, L.\n\n\n \n\n\n\n J. Glob. Optim., 70(3): 625–644. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jgo/BuchheimSRT18,\n    author = "Buchheim, Christoph and Santis, Marianna De and Rinaldi, Francesco and Trieu, Long",\n    title = "A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization",\n    journal = "J. Glob. Optim.",\n    volume = "70",\n    number = "3",\n    pages = "625--644",\n    year = "2018",\n    url = "https://doi.org/10.1007/s10898-017-0571-4",\n    doi = "10.1007/S10898-017-0571-4",\n    timestamp = "Mon, 03 Mar 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/jgo/BuchheimSRT18.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Using a factored dual in augmented Lagrangian methods for semidefinite programming.\n \n \n \n \n\n\n \n Santis, M. D.; Rendl, F.; and Wiegele, A.\n\n\n \n\n\n\n Oper. Res. Lett., 46(5): 523–528. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"UsingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/orl/SantisRW18,\n    author = "Santis, Marianna De and Rendl, Franz and Wiegele, Angelika",\n    title = "Using a factored dual in augmented Lagrangian methods for semidefinite programming",\n    journal = "Oper. Res. Lett.",\n    volume = "46",\n    number = "5",\n    pages = "523--528",\n    year = "2018",\n    url = "https://doi.org/10.1016/j.orl.2018.08.003",\n    doi = "10.1016/J.ORL.2018.08.003",\n    timestamp = "Sun, 19 Jan 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/orl/SantisRW18.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Lagrangean-Based Combinatorial Optimization for Large-Scale S\\(^\\mbox3\\)VMs.\n \n \n \n \n\n\n \n Bagattini, F.; Cappanera, P.; and Schoen, F.\n\n\n \n\n\n\n IEEE Trans. Neural Networks Learn. Syst., 29(9): 4426–4435. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"Lagrangean-BasedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/tnn/BagattiniCS18,\n    author = "Bagattini, Francesco and Cappanera, Paola and Schoen, Fabio",\n    title = "Lagrangean-Based Combinatorial Optimization for Large-Scale S\\({}^{\\mbox{3}}\\)VMs",\n    journal = "{IEEE} Trans. Neural Networks Learn. Syst.",\n    volume = "29",\n    number = "9",\n    pages = "4426--4435",\n    year = "2018",\n    url = "https://doi.org/10.1109/TNNLS.2017.2766704",\n    doi = "10.1109/TNNLS.2017.2766704",\n    timestamp = "Sat, 30 May 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/tnn/BagattiniCS18.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Demonstration of Latency-Aware and Self-Adaptive Service Chaining in 5G/SDN/NFV infrastructures.\n \n \n \n \n\n\n \n Gharbaoui, M.; Contoli, C.; Davoli, G.; Cuffaro, G.; Martini, B.; Paganelli, F.; Cerroni, W.; Cappanera, P.; and Castoldi, P.\n\n\n \n\n\n\n In IEEE Conference on Network Function Virtualization and Software Defined Networks, NFV-SDN 2018, Verona, Italy, November 27-29, 2018, pages 1–2, 2018. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"DemonstrationPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/nfvsdn/GharbaouiCDCMPC18,\n    author = "Gharbaoui, Molka and Contoli, Chiara and Davoli, Gianluca and Cuffaro, Giovanni and Martini, Barbara and Paganelli, Federica and Cerroni, Walter and Cappanera, Paola and Castoldi, Piero",\n    title = "Demonstration of Latency-Aware and Self-Adaptive Service Chaining in 5G/SDN/NFV infrastructures",\n    booktitle = "{IEEE} Conference on Network Function Virtualization and Software Defined Networks, {NFV-SDN} 2018, Verona, Italy, November 27-29, 2018",\n    pages = "1--2",\n    publisher = "{IEEE}",\n    year = "2018",\n    url = "https://doi.org/10.1109/NFV-SDN.2018.8725645",\n    doi = "10.1109/NFV-SDN.2018.8725645",\n    timestamp = "Sun, 06 Oct 2024 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/conf/nfvsdn/GharbaouiCDCMPC18.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Experimenting latency-aware and reliable service chaining in Next Generation Internet testbed facility.\n \n \n \n \n\n\n \n Gharbaoui, M.; Contoli, C.; Davoli, G.; Cuffaro, G.; Martini, B.; Paganelli, F.; Cerroni, W.; Cappanera, P.; and Castoldi, P.\n\n\n \n\n\n\n In IEEE Conference on Network Function Virtualization and Software Defined Networks, NFV-SDN 2018, Verona, Italy, November 27-29, 2018, pages 1–4, 2018. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"ExperimentingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/nfvsdn/GharbaouiCDCMPC18a,\n    author = "Gharbaoui, Molka and Contoli, Chiara and Davoli, Gianluca and Cuffaro, Giovanni and Martini, Barbara and Paganelli, Federica and Cerroni, Walter and Cappanera, Paola and Castoldi, Piero",\n    title = "Experimenting latency-aware and reliable service chaining in Next Generation Internet testbed facility",\n    booktitle = "{IEEE} Conference on Network Function Virtualization and Software Defined Networks, {NFV-SDN} 2018, Verona, Italy, November 27-29, 2018",\n    pages = "1--4",\n    publisher = "{IEEE}",\n    year = "2018",\n    url = "https://doi.org/10.1109/NFV-SDN.2018.8725783",\n    doi = "10.1109/NFV-SDN.2018.8725783",\n    timestamp = "Sun, 06 Oct 2024 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/conf/nfvsdn/GharbaouiCDCMPC18a.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Largest Minimal Inversion-Complete and Pair-Complete Sets of Permutations.\n \n \n \n \n\n\n \n Balandraud, É.; Tardella, F.; and Queyranne, M.\n\n\n \n\n\n\n Comb., 38(1): 29–41. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"LargestPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/combinatorica/BalandraudTQ18,\n    author = "Balandraud, {\\'{E}}ric and Tardella, Fabio and Queyranne, Maurice",\n    title = "Largest Minimal Inversion-Complete and Pair-Complete Sets of Permutations",\n    journal = "Comb.",\n    volume = "38",\n    number = "1",\n    pages = "29--41",\n    year = "2018",\n    url = "https://doi.org/10.1007/s00493-016-3426-6",\n    doi = "10.1007/S00493-016-3426-6",\n    timestamp = "Wed, 22 Jul 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/combinatorica/BalandraudTQ18.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Complexity of some graph-based bounds on the probability of a union of events.\n \n \n \n \n\n\n \n Scozzari, A.; and Tardella, F.\n\n\n \n\n\n\n Discret. Appl. Math., 244: 186–197. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"ComplexityPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/dam/ScozzariT18,\n    author = "Scozzari, Andrea and Tardella, Fabio",\n    title = "Complexity of some graph-based bounds on the probability of a union of events",\n    journal = "Discret. Appl. Math.",\n    volume = "244",\n    pages = "186--197",\n    year = "2018",\n    url = "https://doi.org/10.1016/j.dam.2018.03.012",\n    doi = "10.1016/J.DAM.2018.03.012",\n    timestamp = "Thu, 20 Feb 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/dam/ScozzariT18.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Alternating Current Optimal Power Flow with Generator Selection.\n \n \n \n \n\n\n \n Salgado, E.; Scozzari, A.; Tardella, F.; and Liberti, L.\n\n\n \n\n\n\n In Lee, J.; Rinaldi, G.; and Mahjoub, A. R., editor(s), Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers, volume 10856, of Lecture Notes in Computer Science, pages 364–375, 2018. Springer\n \n\n\n\n
\n\n\n\n \n \n \"AlternatingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/iscopt/SalgadoSTL18,\n    author = "Salgado, Esteban and Scozzari, Andrea and Tardella, Fabio and Liberti, Leo",\n    editor = "Lee, Jon and Rinaldi, Giovanni and Mahjoub, Ali Ridha",\n    title = "Alternating Current Optimal Power Flow with Generator Selection",\n    booktitle = "Combinatorial Optimization - 5th International Symposium, {ISCO} 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers",\n    series = "Lecture Notes in Computer Science",\n    volume = "10856",\n    pages = "364--375",\n    publisher = "Springer",\n    year = "2018",\n    url = "https://doi.org/10.1007/978-3-319-96151-4\\\\_31",\n    doi = "10.1007/978-3-319-96151-4\\\\_31",\n    timestamp = "Mon, 03 Mar 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/conf/iscopt/SalgadoSTL18.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Exploiting sets of independent moves in VRP.\n \n \n \n \n\n\n \n Bianconcini, T.; Lorenzo, D. D.; Lori, A.; Schoen, F.; and Taccari, L.\n\n\n \n\n\n\n EURO J. Transp. Logist., 7(2): 93–120. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"ExploitingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/ejtl/BianconciniLLST18,\n    author = "Bianconcini, Tommaso and Lorenzo, David Di and Lori, Alessandro and Schoen, Fabio and Taccari, Leonardo",\n    title = "Exploiting sets of independent moves in {VRP}",\n    journal = "{EURO} J. Transp. Logist.",\n    volume = "7",\n    number = "2",\n    pages = "93--120",\n    year = "2018",\n    url = "https://doi.org/10.1007/s13676-017-0110-y",\n    doi = "10.1007/S13676-017-0110-Y",\n    timestamp = "Sun, 02 Nov 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/ejtl/BianconciniLLST18.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Scheduling the Italian National Volleyball Tournament.\n \n \n \n \n\n\n \n Cocchi, G.; Galligari, A.; Nicolino, F. P.; Piccialli, V.; Schoen, F.; and Sciandrone, M.\n\n\n \n\n\n\n Interfaces, 48(3): 271–284. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"SchedulingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/interfaces/CocchiGNPSS18,\n    author = "Cocchi, Guido and Galligari, Alessandro and Nicolino, Federica Picca and Piccialli, Veronica and Schoen, Fabio and Sciandrone, Marco",\n    title = "Scheduling the Italian National Volleyball Tournament",\n    journal = "Interfaces",\n    volume = "48",\n    number = "3",\n    pages = "271--284",\n    year = "2018",\n    url = "https://doi.org/10.1287/inte.2017.0932",\n    doi = "10.1287/INTE.2017.0932",\n    timestamp = "Sun, 19 Jan 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/interfaces/CocchiGNPSS18.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A Two-Stage Active-Set Algorithm for Bound-Constrained Optimization.\n \n \n \n \n\n\n \n Cristofari, A.; Santis, M. D.; Lucidi, S.; and Rinaldi, F.\n\n\n \n\n\n\n J. Optim. Theory Appl., 172(2): 369–401. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jota/CristofariSLR17,\n    author = "Cristofari, Andrea and Santis, Marianna De and Lucidi, Stefano and Rinaldi, Francesco",\n    title = "A Two-Stage Active-Set Algorithm for Bound-Constrained Optimization",\n    journal = "J. Optim. Theory Appl.",\n    volume = "172",\n    number = "2",\n    pages = "369--401",\n    year = "2017",\n    url = "https://doi.org/10.1007/s10957-016-1024-9",\n    doi = "10.1007/S10957-016-1024-9",\n    timestamp = "Tue, 29 Dec 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/jota/CristofariSLR17.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Simple and Effective Lagrangian-Based Combinatorial Algorithm for S ^3 3 VMs.\n \n \n \n \n\n\n \n Bagattini, F.; Cappanera, P.; and Schoen, F.\n\n\n \n\n\n\n In Nicosia, G.; Pardalos, P. M.; Giuffrida, G.; and Umeton, R., editor(s), Machine Learning, Optimization, and Big Data - Third International Conference, MOD 2017, Volterra, Italy, September 14-17, 2017, Revised Selected Papers, volume 10710, of Lecture Notes in Computer Science, pages 244–254, 2017. Springer\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/mod/BagattiniCS17,\n    author = "Bagattini, Francesco and Cappanera, Paola and Schoen, Fabio",\n    editor = "Nicosia, Giuseppe and Pardalos, Panos M. and Giuffrida, Giovanni and Umeton, Renato",\n    title = "A Simple and Effective Lagrangian-Based Combinatorial Algorithm for {S} {\\^{}}3 3 VMs",\n    booktitle = "Machine Learning, Optimization, and Big Data - Third International Conference, {MOD} 2017, Volterra, Italy, September 14-17, 2017, Revised Selected Papers",\n    series = "Lecture Notes in Computer Science",\n    volume = "10710",\n    pages = "244--254",\n    publisher = "Springer",\n    year = "2017",\n    url = "https://doi.org/10.1007/978-3-319-72926-8\\\\_21",\n    doi = "10.1007/978-3-319-72926-8\\\\_21",\n    timestamp = "Tue, 14 May 2019 10:00:51 +0200",\n    biburl = "https://dblp.org/rec/conf/mod/BagattiniCS17.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On exact and approximate stochastic dominance strategies for portfolio selection.\n \n \n \n \n\n\n \n Bruni, R.; Cesarone, F.; Scozzari, A.; and Tardella, F.\n\n\n \n\n\n\n Eur. J. Oper. Res., 259(1): 322–329. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/eor/BruniCST17,\n    author = "Bruni, Renato and Cesarone, Francesco and Scozzari, Andrea and Tardella, Fabio",\n    title = "On exact and approximate stochastic dominance strategies for portfolio selection",\n    journal = "Eur. J. Oper. Res.",\n    volume = "259",\n    number = "1",\n    pages = "322--329",\n    year = "2017",\n    url = "https://doi.org/10.1016/j.ejor.2016.10.006",\n    doi = "10.1016/J.EJOR.2016.10.006",\n    timestamp = "Fri, 21 Feb 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/eor/BruniCST17.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Equal Risk Bounding is better than Risk Parity for portfolio selection.\n \n \n \n \n\n\n \n Cesarone, F.; and Tardella, F.\n\n\n \n\n\n\n J. Glob. Optim., 68(2): 439–461. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"EqualPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jgo/CesaroneT17,\n    author = "Cesarone, Francesco and Tardella, Fabio",\n    title = "Equal Risk Bounding is better than Risk Parity for portfolio selection",\n    journal = "J. Glob. Optim.",\n    volume = "68",\n    number = "2",\n    pages = "439--461",\n    year = "2017",\n    url = "https://doi.org/10.1007/s10898-016-0477-6",\n    doi = "10.1007/S10898-016-0477-6",\n    timestamp = "Fri, 11 Sep 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/jgo/CesaroneT17.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Carathéodory, Helly, and Radon Numbers for Sublattice and Related Convexities.\n \n \n \n \n\n\n \n Queyranne, M.; and Tardella, F.\n\n\n \n\n\n\n Math. Oper. Res., 42(2): 495–516. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"Carathéodory,Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/mor/QueyranneT17,\n    author = "Queyranne, Maurice and Tardella, Fabio",\n    title = "Carath{\\'{e}}odory, Helly, and Radon Numbers for Sublattice and Related Convexities",\n    journal = "Math. Oper. Res.",\n    volume = "42",\n    number = "2",\n    pages = "495--516",\n    year = "2017",\n    url = "https://doi.org/10.1287/moor.2016.0815",\n    doi = "10.1287/MOOR.2016.0815",\n    timestamp = "Thu, 24 Aug 2017 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/mor/QueyranneT17.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Local search heuristics for the zone planning problem.\n \n \n \n \n\n\n \n Galligari, A.; Maischberger, M.; and Schoen, F.\n\n\n \n\n\n\n Optim. Lett., 11(1): 195–207. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"LocalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/ol/GalligariMS17,\n    author = "Galligari, Alessandro and Maischberger, Mirko and Schoen, Fabio",\n    title = "Local search heuristics for the zone planning problem",\n    journal = "Optim. Lett.",\n    volume = "11",\n    number = "1",\n    pages = "195--207",\n    year = "2017",\n    url = "https://doi.org/10.1007/s11590-016-1069-6",\n    doi = "10.1007/S11590-016-1069-6",\n    timestamp = "Fri, 03 Jul 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/ol/GalligariMS17.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (9)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Dual approaches for a specific class of integer nonlinear programming problems.\n \n \n \n \n\n\n \n Santis, M. D.\n\n\n \n\n\n\n Electron. Notes Discret. Math., 55: 73–76. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"DualPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/endm/Santis16,\n    author = "Santis, Marianna De",\n    title = "Dual approaches for a specific class of integer nonlinear programming problems",\n    journal = "Electron. Notes Discret. Math.",\n    volume = "55",\n    pages = "73--76",\n    year = "2016",\n    url = "https://doi.org/10.1016/j.endm.2016.10.019",\n    doi = "10.1016/J.ENDM.2016.10.019",\n    timestamp = "Tue, 29 Dec 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/endm/Santis16.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A nonmonotone GRASP.\n \n \n \n \n\n\n \n Santis, M. D.; Festa, P.; Liuzzi, G.; Lucidi, S.; and Rinaldi, F.\n\n\n \n\n\n\n Math. Program. Comput., 8(3): 271–309. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/mpc/SantisFLLR16,\n    author = "Santis, Marianna De and Festa, Paola and Liuzzi, Giampaolo and Lucidi, Stefano and Rinaldi, Francesco",\n    title = "A nonmonotone {GRASP}",\n    journal = "Math. Program. Comput.",\n    volume = "8",\n    number = "3",\n    pages = "271--309",\n    year = "2016",\n    url = "https://doi.org/10.1007/s12532-016-0107-9",\n    doi = "10.1007/S12532-016-0107-9",\n    timestamp = "Tue, 29 Dec 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/mpc/SantisFLLR16.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Fast Active Set Block Coordinate Descent Algorithm for \\(ℓ\\)\\(_\\mbox1\\)-Regularized Least Squares.\n \n \n \n \n\n\n \n Santis, M. D.; Lucidi, S.; and Rinaldi, F.\n\n\n \n\n\n\n SIAM J. Optim., 26(1): 781–809. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/siamjo/SantisLR16,\n    author = "Santis, Marianna De and Lucidi, Stefano and Rinaldi, Francesco",\n    title = "A Fast Active Set Block Coordinate Descent Algorithm for {\\(\\mathscr{l}\\)}\\({}\\_{\\mbox{1}}\\)-Regularized Least Squares",\n    journal = "{SIAM} J. Optim.",\n    volume = "26",\n    number = "1",\n    pages = "781--809",\n    year = "2016",\n    url = "https://doi.org/10.1137/141000737",\n    doi = "10.1137/141000737",\n    timestamp = "Tue, 29 Dec 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/siamjo/SantisLR16.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming.\n \n \n \n \n\n\n \n Buchheim, C.; Santis, M. D.; Lucidi, S.; Rinaldi, F.; and Trieu, L.\n\n\n \n\n\n\n SIAM J. Optim., 26(3): 1695–1714. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/siamjo/BuchheimSLRT16,\n    author = "Buchheim, Christoph and Santis, Marianna De and Lucidi, Stefano and Rinaldi, Francesco and Trieu, Long",\n    title = "A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming",\n    journal = "{SIAM} J. Optim.",\n    volume = "26",\n    number = "3",\n    pages = "1695--1714",\n    year = "2016",\n    url = "https://doi.org/10.1137/140978971",\n    doi = "10.1137/140978971",\n    timestamp = "Tue, 29 Dec 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/siamjo/BuchheimSLRT16.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Pattern-based decompositions for human resource planning in home health care services.\n \n \n \n \n\n\n \n Yalçindag, S.; Cappanera, P.; Scutellà, M. G.; Sahin, E.; and Matta, A.\n\n\n \n\n\n\n Comput. Oper. Res., 73: 12–26. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"Pattern-basedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/cor/YalcindagCSSM16,\n    author = "Yal{\\c{c}}indag, Semih and Cappanera, Paola and Scutell{\\`{a}}, Maria Grazia and Sahin, Evren and Matta, Andrea",\n    title = "Pattern-based decompositions for human resource planning in home health care services",\n    journal = "Comput. Oper. Res.",\n    volume = "73",\n    pages = "12--26",\n    year = "2016",\n    url = "https://doi.org/10.1016/j.cor.2016.02.011",\n    doi = "10.1016/J.COR.2016.02.011",\n    timestamp = "Sun, 07 Dec 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/cor/YalcindagCSSM16.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Routing hazardous materials by compulsory check points in case of variable demand.\n \n \n \n \n\n\n \n Cappanera, P.; Nonato, M.; and Visintin, F.\n\n\n \n\n\n\n Electron. Notes Discret. Math., 52: 53–60. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"RoutingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/endm/CappaneraNV16,\n    author = "Cappanera, Paola and Nonato, Maddalena and Visintin, Filippo",\n    title = "Routing hazardous materials by compulsory check points in case of variable demand",\n    journal = "Electron. Notes Discret. Math.",\n    volume = "52",\n    pages = "53--60",\n    year = "2016",\n    url = "https://doi.org/10.1016/j.endm.2016.03.008",\n    doi = "10.1016/J.ENDM.2016.03.008",\n    timestamp = "Thu, 20 Feb 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/endm/CappaneraNV16.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Scaling and Proximity Properties of Integrally Convex Functions.\n \n \n \n \n\n\n \n Moriguchi, S.; Murota, K.; Tamura, A.; and Tardella, F.\n\n\n \n\n\n\n In Hong, S., editor(s), 27th International Symposium on Algorithms and Computation, ISAAC 2016, Sydney, Australia, December 12-14, 2016, volume 64, of LIPIcs, pages 57:1–57:13, 2016. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"ScalingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/isaac/MoriguchiMTT16,\n    author = "Moriguchi, Satoko and Murota, Kazuo and Tamura, Akihisa and Tardella, Fabio",\n    editor = "Hong, Seok{-}Hee",\n    title = "Scaling and Proximity Properties of Integrally Convex Functions",\n    booktitle = "27th International Symposium on Algorithms and Computation, {ISAAC} 2016, Sydney, Australia, December 12-14, 2016",\n    series = "LIPIcs",\n    volume = "64",\n    pages = "57:1--57:13",\n    publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n    year = "2016",\n    url = "https://doi.org/10.4230/LIPIcs.ISAAC.2016.57",\n    doi = "10.4230/LIPICS.ISAAC.2016.57",\n    timestamp = "Fri, 21 Nov 2025 23:44:11 +0100",\n    biburl = "https://dblp.org/rec/conf/isaac/MoriguchiMTT16.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Global optimization based on local searches.\n \n \n \n \n\n\n \n Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n Ann. Oper. Res., 240(1): 251–270. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"GlobalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/anor/LocatelliS16,\n    author = "Locatelli, Marco and Schoen, Fabio",\n    title = "Global optimization based on local searches",\n    journal = "Ann. Oper. Res.",\n    volume = "240",\n    number = "1",\n    pages = "251--270",\n    year = "2016",\n    url = "https://doi.org/10.1007/s10479-015-2014-2",\n    doi = "10.1007/S10479-015-2014-2",\n    timestamp = "Thu, 13 Aug 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/anor/LocatelliS16.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Path Clustering Based on a Novel Dissimilarity Function for Ride-Sharing Recommenders.\n \n \n \n \n\n\n \n D'Andrea, E.; Lorenzo, D. D.; Lazzerini, B.; Marcelloni, F.; and Schoen, F.\n\n\n \n\n\n\n In 2016 IEEE International Conference on Smart Computing, SMARTCOMP 2016, St Louis, MO, USA, May 18-20, 2016, pages 1–8, 2016. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"PathPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/smartcomp/DAndreaLLMS16,\n    author = "D'Andrea, Eleonora and Lorenzo, David Di and Lazzerini, Beatrice and Marcelloni, Francesco and Schoen, Fabio",\n    title = "Path Clustering Based on a Novel Dissimilarity Function for Ride-Sharing Recommenders",\n    booktitle = "2016 {IEEE} International Conference on Smart Computing, {SMARTCOMP} 2016, St Louis, MO, USA, May 18-20, 2016",\n    pages = "1--8",\n    publisher = "{IEEE} Computer Society",\n    year = "2016",\n    url = "https://doi.org/10.1109/SMARTCOMP.2016.7501712",\n    doi = "10.1109/SMARTCOMP.2016.7501712",\n    timestamp = "Thu, 23 Mar 2023 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/conf/smartcomp/DAndreaLLMS16.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (7)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations.\n \n \n \n \n\n\n \n Buchheim, C.; Santis, M. D.; and Palagi, L.\n\n\n \n\n\n\n Oper. Res. Lett., 43(4): 384–388. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/orl/BuchheimSP15,\n    author = "Buchheim, Christoph and Santis, Marianna De and Palagi, Laura",\n    title = "A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations",\n    journal = "Oper. Res. Lett.",\n    volume = "43",\n    number = "4",\n    pages = "384--388",\n    year = "2015",\n    url = "https://doi.org/10.1016/j.orl.2015.05.001",\n    doi = "10.1016/J.ORL.2015.05.001",\n    timestamp = "Tue, 29 Dec 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/orl/BuchheimSP15.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Schedulability of Deadline-Constrained Traffic in TDMA Wireless Mesh Networks.\n \n \n \n \n\n\n \n Cappanera, P.; Lori, A.; Stea, G.; and Vaglini, G.\n\n\n \n\n\n\n Comput. J., 58(2): 215–233. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/cj/CappaneraLSV15,\n    author = "Cappanera, Paola and Lori, Alessandro and Stea, Giovanni and Vaglini, Gigliola",\n    title = "On the Schedulability of Deadline-Constrained Traffic in {TDMA} Wireless Mesh Networks",\n    journal = "Comput. J.",\n    volume = "58",\n    number = "2",\n    pages = "215--233",\n    year = "2015",\n    url = "https://doi.org/10.1093/comjnl/bxt154",\n    doi = "10.1093/COMJNL/BXT154",\n    timestamp = "Mon, 05 Jun 2017 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/cj/CappaneraLSV15.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Joint Assignment, Scheduling, and Routing Models to Home Care Optimization: A Pattern-Based Approach.\n \n \n \n \n\n\n \n Cappanera, P.; and Scutellà, M. G.\n\n\n \n\n\n\n Transp. Sci., 49(4): 830–852. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"JointPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/transci/CappaneraS15,\n    author = "Cappanera, Paola and Scutell{\\`{a}}, Maria Grazia",\n    title = "Joint Assignment, Scheduling, and Routing Models to Home Care Optimization: {A} Pattern-Based Approach",\n    journal = "Transp. Sci.",\n    volume = "49",\n    number = "4",\n    pages = "830--852",\n    year = "2015",\n    url = "https://doi.org/10.1287/trsc.2014.0548",\n    doi = "10.1287/TRSC.2014.0548",\n    timestamp = "Tue, 08 Sep 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/transci/CappaneraS15.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Latency-aware composition of Virtual Functions in 5G.\n \n \n \n \n\n\n \n Martini, B.; Paganelli, F.; Cappanera, P.; Turchi, S.; and Castoldi, P.\n\n\n \n\n\n\n In Proceedings of the 1st IEEE Conference on Network Softwarization, NetSoft 2015, London, United Kingdom, April 13-17, 2015, pages 1–6, 2015. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"Latency-awarePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/netsoft/MartiniPCTC15,\n    author = "Martini, Barbara and Paganelli, Federica and Cappanera, Paola and Turchi, Stefano and Castoldi, Piero",\n    title = "Latency-aware composition of Virtual Functions in 5G",\n    booktitle = "Proceedings of the 1st {IEEE} Conference on Network Softwarization, NetSoft 2015, London, United Kingdom, April 13-17, 2015",\n    pages = "1--6",\n    publisher = "{IEEE}",\n    year = "2015",\n    url = "https://doi.org/10.1109/NETSOFT.2015.7116188",\n    doi = "10.1109/NETSOFT.2015.7116188",\n    timestamp = "Fri, 09 Apr 2021 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/conf/netsoft/MartiniPCTC15.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Linear vs. quadratic portfolio selection models with hard real-world constraints.\n \n \n \n \n\n\n \n Cesarone, F.; Scozzari, A.; and Tardella, F.\n\n\n \n\n\n\n Comput. Manag. Sci., 12(3): 345–370. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"LinearPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/cms/CesaroneST15,\n    author = "Cesarone, Francesco and Scozzari, Andrea and Tardella, Fabio",\n    title = "Linear vs. quadratic portfolio selection models with hard real-world constraints",\n    journal = "Comput. Manag. Sci.",\n    volume = "12",\n    number = "3",\n    pages = "345--370",\n    year = "2015",\n    url = "https://doi.org/10.1007/s10287-014-0210-1",\n    doi = "10.1007/S10287-014-0210-1",\n    timestamp = "Sun, 10 May 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/cms/CesaroneST15.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A linear risk-return model for enhanced indexation in portfolio optimization.\n \n \n \n \n\n\n \n Bruni, R.; Cesarone, F.; Scozzari, A.; and Tardella, F.\n\n\n \n\n\n\n OR Spectr., 37(3): 735–759. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/ors/BruniCST15,\n    author = "Bruni, Renato and Cesarone, Francesco and Scozzari, Andrea and Tardella, Fabio",\n    title = "A linear risk-return model for enhanced indexation in portfolio optimization",\n    journal = "{OR} Spectr.",\n    volume = "37",\n    number = "3",\n    pages = "735--759",\n    year = "2015",\n    url = "https://doi.org/10.1007/s00291-014-0383-6",\n    doi = "10.1007/S00291-014-0383-6",\n    timestamp = "Fri, 06 Mar 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/ors/BruniCST15.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Foreword.\n \n \n \n \n\n\n \n Palagi, L.; and Schoen, F.\n\n\n \n\n\n\n Optim. Methods Softw., 30(2): 251–252. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"ForewordPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/oms/PalagiS15,\n    author = "Palagi, Laura and Schoen, Fabio",\n    title = "Foreword",\n    journal = "Optim. Methods Softw.",\n    volume = "30",\n    number = "2",\n    pages = "251--252",\n    year = "2015",\n    url = "https://doi.org/10.1080/10556788.2015.996437",\n    doi = "10.1080/10556788.2015.996437",\n    timestamp = "Thu, 24 Sep 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/oms/PalagiS15.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2014\n \n \n (8)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Combining optimization and machine learning techniques for genome-wide prediction of human cell cycle-regulated genes.\n \n \n \n \n\n\n \n Santis, M. D.; Rinaldi, F.; Falcone, E.; Lucidi, S.; Piaggio, G.; Gurtner, A.; and Farina, L.\n\n\n \n\n\n\n Bioinform., 30(2): 228–233. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"CombiningPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/bioinformatics/SantisRFLPGF14,\n    author = "Santis, Marianna De and Rinaldi, Francesco and Falcone, Emmanuela and Lucidi, Stefano and Piaggio, Giulia and Gurtner, Aymone and Farina, Lorenzo",\n    title = "Combining optimization and machine learning techniques for genome-wide prediction of human cell cycle-regulated genes",\n    journal = "Bioinform.",\n    volume = "30",\n    number = "2",\n    pages = "228--233",\n    year = "2014",\n    url = "https://doi.org/10.1093/bioinformatics/btt671",\n    doi = "10.1093/BIOINFORMATICS/BTT671",\n    timestamp = "Tue, 29 Dec 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/bioinformatics/SantisRFLPGF14.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Feasibility Pump-like heuristics for mixed integer problems.\n \n \n \n \n\n\n \n Santis, M. D.; Lucidi, S.; and Rinaldi, F.\n\n\n \n\n\n\n Discret. Appl. Math., 165: 152–167. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"FeasibilityPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/dam/SantisLR14,\n    author = "Santis, Marianna De and Lucidi, Stefano and Rinaldi, Francesco",\n    title = "Feasibility Pump-like heuristics for mixed integer problems",\n    journal = "Discret. Appl. Math.",\n    volume = "165",\n    pages = "152--167",\n    year = "2014",\n    url = "https://doi.org/10.1016/j.dam.2013.06.018",\n    doi = "10.1016/J.DAM.2013.06.018",\n    timestamp = "Thu, 11 Feb 2021 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/dam/SantisLR14.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Fast Active Set Block Coordinate Descent Algorithm for \\(ℓ\\)\\(_\\mbox1\\)-regularized least squares.\n \n \n \n \n\n\n \n Santis, M. D.; Lucidi, S.; and Rinaldi, F.\n\n\n \n\n\n\n CoRR, abs/1403.1738. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/SantisLR14,\n    author = "Santis, Marianna De and Lucidi, Stefano and Rinaldi, Francesco",\n    title = "A Fast Active Set Block Coordinate Descent Algorithm for {\\(\\mathscr{l}\\)}\\({}\\_{\\mbox{1}}\\)-regularized least squares",\n    journal = "CoRR",\n    volume = "abs/1403.1738",\n    year = "2014",\n    url = "http://arxiv.org/abs/1403.1738",\n    eprinttype = "arXiv",\n    eprint = "1403.1738",\n    timestamp = "Mon, 13 Aug 2018 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/corr/SantisLR14.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Gateway Location Problem: Assessing the impact of candidate site selection policies.\n \n \n \n \n\n\n \n Bruglieri, M.; Cappanera, P.; and Nonato, M.\n\n\n \n\n\n\n Discret. Appl. Math., 165: 96–111. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/dam/BruglieriCN14,\n    author = "Bruglieri, Maurizio and Cappanera, Paola and Nonato, Maddalena",\n    title = "The Gateway Location Problem: Assessing the impact of candidate site selection policies",\n    journal = "Discret. Appl. Math.",\n    volume = "165",\n    pages = "96--111",\n    year = "2014",\n    url = "https://doi.org/10.1016/j.dam.2013.06.017",\n    doi = "10.1016/J.DAM.2013.06.017",\n    timestamp = "Mon, 03 Mar 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/dam/BruglieriCN14.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Polynomially Computable Bounds for the Probability of the Union of Events.\n \n \n \n \n\n\n \n Boros, E.; Scozzari, A.; Tardella, F.; and Veneziani, P.\n\n\n \n\n\n\n Math. Oper. Res., 39(4): 1311–1329. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"PolynomiallyPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/mor/BorosSTV14,\n    author = "Boros, Endre and Scozzari, Andrea and Tardella, Fabio and Veneziani, Pierangela",\n    title = "Polynomially Computable Bounds for the Probability of the Union of Events",\n    journal = "Math. Oper. Res.",\n    volume = "39",\n    number = "4",\n    pages = "1311--1329",\n    year = "2014",\n    url = "https://doi.org/10.1287/moor.2014.0657",\n    doi = "10.1287/MOOR.2014.0657",\n    timestamp = "Sun, 02 Jun 2019 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/mor/BorosSTV14.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Differential evolution methods based on local searches.\n \n \n \n \n\n\n \n Locatelli, M.; Maischberger, M.; and Schoen, F.\n\n\n \n\n\n\n Comput. Oper. Res., 43: 169–180. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"DifferentialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/cor/LocatelliMS14,\n    author = "Locatelli, Marco and Maischberger, Mirko and Schoen, Fabio",\n    title = "Differential evolution methods based on local searches",\n    journal = "Comput. Oper. Res.",\n    volume = "43",\n    pages = "169--180",\n    year = "2014",\n    url = "https://doi.org/10.1016/j.cor.2013.09.010",\n    doi = "10.1016/J.COR.2013.09.010",\n    timestamp = "Tue, 18 Feb 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/cor/LocatelliMS14.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Energy-Efficient Resource Allocation Scheme for RLNC-Based Heterogeneous Multicast Communications.\n \n \n \n \n\n\n \n Tassi, A.; Chiti, F.; Fantacci, R.; and Schoen, F.\n\n\n \n\n\n\n IEEE Commun. Lett., 18(8): 1399–1402. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/icl/TassiCFS14,\n    author = "Tassi, Andrea and Chiti, Francesco and Fantacci, Romano and Schoen, Fabio",\n    title = "An Energy-Efficient Resource Allocation Scheme for RLNC-Based Heterogeneous Multicast Communications",\n    journal = "{IEEE} Commun. Lett.",\n    volume = "18",\n    number = "8",\n    pages = "1399--1402",\n    year = "2014",\n    url = "https://doi.org/10.1109/LCOMM.2014.2331069",\n    doi = "10.1109/LCOMM.2014.2331069",\n    timestamp = "Thu, 20 Aug 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/icl/TassiCFS14.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On convex envelopes for bivariate functions over polytopes.\n \n \n \n \n\n\n \n Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n Math. Program., 144(1-2): 65–91. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/mp/LocatelliS14,\n    author = "Locatelli, Marco and Schoen, Fabio",\n    title = "On convex envelopes for bivariate functions over polytopes",\n    journal = "Math. Program.",\n    volume = "144",\n    number = "1-2",\n    pages = "65--91",\n    year = "2014",\n    url = "https://doi.org/10.1007/s10107-012-0616-x",\n    doi = "10.1007/S10107-012-0616-X",\n    timestamp = "Tue, 07 May 2019 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/mp/LocatelliS14.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2013\n \n \n (12)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach.\n \n \n \n \n\n\n \n Santis, M. D.; Lucidi, S.; and Rinaldi, F.\n\n\n \n\n\n\n SIAM J. Optim., 23(3): 1575–1606. 2013.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/siamjo/SantisLR13,\n    author = "Santis, Marianna De and Lucidi, Stefano and Rinaldi, Francesco",\n    title = "A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach",\n    journal = "{SIAM} J. Optim.",\n    volume = "23",\n    number = "3",\n    pages = "1575--1606",\n    year = "2013",\n    url = "https://doi.org/10.1137/110855351",\n    doi = "10.1137/110855351",\n    timestamp = "Tue, 29 Dec 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/siamjo/SantisLR13.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations.\n \n \n \n \n\n\n \n Buchheim, C.; Santis, M. D.; Palagi, L.; and Piacentini, M.\n\n\n \n\n\n\n SIAM J. Optim., 23(3): 1867–1889. 2013.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/siamjo/BuchheimSPP13,\n    author = "Buchheim, Christoph and Santis, Marianna De and Palagi, Laura and Piacentini, Mauro",\n    title = "An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations",\n    journal = "{SIAM} J. Optim.",\n    volume = "23",\n    number = "3",\n    pages = "1867--1889",\n    year = "2013",\n    url = "https://doi.org/10.1137/120878495",\n    doi = "10.1137/120878495",\n    timestamp = "Tue, 29 Dec 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/siamjo/BuchheimSPP13.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Optimal joint routing and link scheduling for real-time traffic in TDMA Wireless Mesh Networks.\n \n \n \n \n\n\n \n Cappanera, P.; Lenzini, L.; Lori, A.; Stea, G.; and Vaglini, G.\n\n\n \n\n\n\n Comput. Networks, 57(11): 2301–2312. 2013.\n \n\n\n\n
\n\n\n\n \n \n \"OptimalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/cn/CappaneraLLSV13,\n    author = "Cappanera, Paola and Lenzini, Luciano and Lori, Alessandro and Stea, Giovanni and Vaglini, Gigliola",\n    title = "Optimal joint routing and link scheduling for real-time traffic in {TDMA} Wireless Mesh Networks",\n    journal = "Comput. Networks",\n    volume = "57",\n    number = "11",\n    pages = "2301--2312",\n    year = "2013",\n    url = "https://doi.org/10.1016/j.comnet.2012.11.021",\n    doi = "10.1016/J.COMNET.2012.11.021",\n    timestamp = "Wed, 19 Feb 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/cn/CappaneraLLSV13.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Models and valid inequalities to asymmetric skill-based routing problems.\n \n \n \n \n\n\n \n Cappanera, P.; Gouveia, L. E. N.; and Scutellà, M. G.\n\n\n \n\n\n\n EURO J. Transp. Logist., 2(1-2): 29–55. 2013.\n \n\n\n\n
\n\n\n\n \n \n \"ModelsPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/ejtl/CappaneraGS13,\n    author = "Cappanera, Paola and Gouveia, Luis Eduardo Neves and Scutell{\\`{a}}, Maria Grazia",\n    title = "Models and valid inequalities to asymmetric skill-based routing problems",\n    journal = "{EURO} J. Transp. Logist.",\n    volume = "2",\n    number = "1-2",\n    pages = "29--55",\n    year = "2013",\n    url = "https://doi.org/10.1007/s13676-012-0012-y",\n    doi = "10.1007/S13676-012-0012-Y",\n    timestamp = "Sun, 02 Nov 2025 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/ejtl/CappaneraGS13.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Home Care optimization: impact of pattern generation policies on scheduling and routing decisions.\n \n \n \n \n\n\n \n Cappanera, P.; and Scutellà, M. G.\n\n\n \n\n\n\n Electron. Notes Discret. Math., 41: 53–60. 2013.\n \n\n\n\n
\n\n\n\n \n \n \"HomePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/endm/CappaneraS13,\n    author = "Cappanera, Paola and Scutell{\\`{a}}, Maria Grazia",\n    title = "Home Care optimization: impact of pattern generation policies on scheduling and routing decisions",\n    journal = "Electron. Notes Discret. Math.",\n    volume = "41",\n    pages = "53--60",\n    year = "2013",\n    url = "https://doi.org/10.1016/j.endm.2013.05.075",\n    doi = "10.1016/J.ENDM.2013.05.075",\n    timestamp = "Thu, 20 Feb 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/endm/CappaneraS13.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A new method for mean-variance portfolio optimization with cardinality constraints.\n \n \n \n \n\n\n \n Cesarone, F.; Scozzari, A.; and Tardella, F.\n\n\n \n\n\n\n Ann. Oper. Res., 205(1): 213–234. 2013.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/anor/CesaroneST13,\n    author = "Cesarone, Francesco and Scozzari, Andrea and Tardella, Fabio",\n    title = "A new method for mean-variance portfolio optimization with cardinality constraints",\n    journal = "Ann. Oper. Res.",\n    volume = "205",\n    number = "1",\n    pages = "213--234",\n    year = "2013",\n    url = "https://doi.org/10.1007/s10479-012-1165-7",\n    doi = "10.1007/S10479-012-1165-7",\n    timestamp = "Thu, 13 Aug 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/anor/CesaroneST13.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Exact and heuristic approaches for the index tracking problem with UCITS constraints.\n \n \n \n \n\n\n \n Scozzari, A.; Tardella, F.; Paterlini, S.; and Krink, T.\n\n\n \n\n\n\n Ann. Oper. Res., 205(1): 235–250. 2013.\n \n\n\n\n
\n\n\n\n \n \n \"ExactPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/anor/ScozzariTPK13,\n    author = "Scozzari, Andrea and Tardella, Fabio and Paterlini, Sandra and Krink, Thiemo",\n    title = "Exact and heuristic approaches for the index tracking problem with {UCITS} constraints",\n    journal = "Ann. Oper. Res.",\n    volume = "205",\n    number = "1",\n    pages = "235--250",\n    year = "2013",\n    url = "https://doi.org/10.1007/s10479-012-1207-1",\n    doi = "10.1007/S10479-012-1207-1",\n    timestamp = "Thu, 13 Aug 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/anor/ScozzariTPK13.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Global Optimization - Theory, Algorithms, and Applications.\n \n \n \n\n\n \n Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n Volume 15 of MOS-SIAM Series on OptimizationSIAM, 2013.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@book{DBLP:books/daglib/0032694,\n    author = "Locatelli, Marco and Schoen, Fabio",\n    title = "Global Optimization - Theory, Algorithms, and Applications",\n    series = "{MOS-SIAM} Series on Optimization",\n    volume = "15",\n    publisher = "{SIAM}",\n    year = "2013",\n    isbn = "978-1-61197-266-5",\n    timestamp = "Fri, 28 Jun 2019 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/books/daglib/0032694.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Global optimization based on local searches.\n \n \n \n \n\n\n \n Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n 4OR, 11(4): 301–321. 2013.\n \n\n\n\n
\n\n\n\n \n \n \"GlobalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/4or/LocatelliS13,\n    author = "Locatelli, Marco and Schoen, Fabio",\n    title = "Global optimization based on local searches",\n    journal = "4OR",\n    volume = "11",\n    number = "4",\n    pages = "301--321",\n    year = "2013",\n    url = "https://doi.org/10.1007/s10288-013-0251-2",\n    doi = "10.1007/S10288-013-0251-2",\n    timestamp = "Tue, 07 May 2019 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/4or/LocatelliS13.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Optimized Random Network Coding for Reliable Multicast Communications.\n \n \n \n \n\n\n \n Chiti, F.; Fantacci, R.; Schoen, F.; and Tassi, A.\n\n\n \n\n\n\n IEEE Commun. Lett., 17(8): 1624–1627. 2013.\n \n\n\n\n
\n\n\n\n \n \n \"OptimizedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/icl/ChitiFST13,\n    author = "Chiti, Francesco and Fantacci, Romano and Schoen, Fabio and Tassi, Andrea",\n    title = "Optimized Random Network Coding for Reliable Multicast Communications",\n    journal = "{IEEE} Commun. Lett.",\n    volume = "17",\n    number = "8",\n    pages = "1624--1627",\n    year = "2013",\n    url = "https://doi.org/10.1109/LCOMM.2013.062113.131139",\n    doi = "10.1109/LCOMM.2013.062113.131139",\n    timestamp = "Thu, 20 Aug 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/icl/ChitiFST13.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Global optimization of expensive black box problems with a known lower bound.\n \n \n \n \n\n\n \n Cassioli, A.; and Schoen, F.\n\n\n \n\n\n\n J. Glob. Optim., 57(1): 177–190. 2013.\n \n\n\n\n
\n\n\n\n \n \n \"GlobalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jgo/CassioliS13,\n    author = "Cassioli, Andrea and Schoen, Fabio",\n    title = "Global optimization of expensive black box problems with a known lower bound",\n    journal = "J. Glob. Optim.",\n    volume = "57",\n    number = "1",\n    pages = "177--190",\n    year = "2013",\n    url = "https://doi.org/10.1007/s10898-011-9834-7",\n    doi = "10.1007/S10898-011-9834-7",\n    timestamp = "Fri, 11 Sep 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/jgo/CassioliS13.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Global Optimization for Atomic Cluster Distance Geometry Problems.\n \n \n \n \n\n\n \n Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n In Mucherino, A.; Lavor, C.; Liberti, L.; and Maculan, N., editor(s), Distance Geometry: Theory, Methods, and Applications, pages 197–212. Springer, 2013.\n \n\n\n\n
\n\n\n\n \n \n \"GlobalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@incollection{DBLP:books/sp/13/0001S13,\n    author = "Locatelli, Marco and Schoen, Fabio",\n    editor = "Mucherino, Antonio and Lavor, Carlile and Liberti, Leo and Maculan, Nelson",\n    title = "Global Optimization for Atomic Cluster Distance Geometry Problems",\n    booktitle = "Distance Geometry: Theory, Methods, and Applications",\n    pages = "197--212",\n    publisher = "Springer",\n    year = "2013",\n    url = "https://doi.org/10.1007/978-1-4614-5128-0\\\\_11",\n    doi = "10.1007/978-1-4614-5128-0\\\\_11",\n    timestamp = "Sat, 19 Oct 2019 19:02:56 +0200",\n    biburl = "https://dblp.org/rec/books/sp/13/0001S13.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2012\n \n \n (7)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n An active set feasible method for large-scale minimization problems with bound constraints.\n \n \n \n \n\n\n \n Santis, M. D.; Pillo, G. D.; and Lucidi, S.\n\n\n \n\n\n\n Comput. Optim. Appl., 53(2): 395–423. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/coap/SantisPL12,\n    author = "Santis, Marianna De and Pillo, Gianni Di and Lucidi, Stefano",\n    title = "An active set feasible method for large-scale minimization problems with bound constraints",\n    journal = "Comput. Optim. Appl.",\n    volume = "53",\n    number = "2",\n    pages = "395--423",\n    year = "2012",\n    url = "https://doi.org/10.1007/s10589-012-9506-7",\n    doi = "10.1007/S10589-012-9506-7",\n    timestamp = "Tue, 29 Dec 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/coap/SantisPL12.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Continuous Reformulations for Zero-One Programming Problems.\n \n \n \n \n\n\n \n Santis, M. D.; and Rinaldi, F.\n\n\n \n\n\n\n J. Optim. Theory Appl., 153(1): 75–84. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"ContinuousPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jota/SantisR12,\n    author = "Santis, Marianna De and Rinaldi, Francesco",\n    title = "Continuous Reformulations for Zero-One Programming Problems",\n    journal = "J. Optim. Theory Appl.",\n    volume = "153",\n    number = "1",\n    pages = "75--84",\n    year = "2012",\n    url = "https://doi.org/10.1007/s10957-011-9935-y",\n    doi = "10.1007/S10957-011-9935-Y",\n    timestamp = "Tue, 29 Dec 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/jota/SantisR12.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Structural and algorithmic properties for parametric minimum cuts.\n \n \n \n \n\n\n \n Granot, F.; McCormick, S. T.; Queyranne, M.; and Tardella, F.\n\n\n \n\n\n\n Math. Program., 135(1-2): 337–367. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"StructuralPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/mp/GranotMQT12,\n    author = "Granot, Frieda and McCormick, S. Thomas and Queyranne, Maurice and Tardella, Fabio",\n    title = "Structural and algorithmic properties for parametric minimum cuts",\n    journal = "Math. Program.",\n    volume = "135",\n    number = "1-2",\n    pages = "337--367",\n    year = "2012",\n    url = "https://doi.org/10.1007/s10107-011-0463-1",\n    doi = "10.1007/S10107-011-0463-1",\n    timestamp = "Sat, 27 May 2017 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/mp/GranotMQT12.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Machine learning for global optimization.\n \n \n \n \n\n\n \n Cassioli, A.; Lorenzo, D. D.; Locatelli, M.; Schoen, F.; and Sciandrone, M.\n\n\n \n\n\n\n Comput. Optim. Appl., 51(1): 279–303. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"MachinePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/coap/CassioliLLSS12,\n    author = "Cassioli, Andrea and Lorenzo, David Di and Locatelli, Marco and Schoen, Fabio and Sciandrone, Marco",\n    title = "Machine learning for global optimization",\n    journal = "Comput. Optim. Appl.",\n    volume = "51",\n    number = "1",\n    pages = "279--303",\n    year = "2012",\n    url = "https://doi.org/10.1007/s10589-010-9330-x",\n    doi = "10.1007/S10589-010-9330-X",\n    timestamp = "Tue, 14 Jul 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/coap/CassioliLLSS12.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Local search based heuristics for global optimization: Atomic clusters and beyond.\n \n \n \n \n\n\n \n Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n Eur. J. Oper. Res., 222(1): 1–9. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"LocalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/eor/LocatelliS12,\n    author = "Locatelli, Marco and Schoen, Fabio",\n    title = "Local search based heuristics for global optimization: Atomic clusters and beyond",\n    journal = "Eur. J. Oper. Res.",\n    volume = "222",\n    number = "1",\n    pages = "1--9",\n    year = "2012",\n    url = "https://doi.org/10.1016/j.ejor.2012.04.010",\n    doi = "10.1016/J.EJOR.2012.04.010",\n    timestamp = "Fri, 21 Feb 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/eor/LocatelliS12.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the relation between concavity cuts and the surrogate dual for convex maximization problems.\n \n \n \n \n\n\n \n Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n J. Glob. Optim., 52(3): 411–421. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jgo/LocatelliS12,\n    author = "Locatelli, Marco and Schoen, Fabio",\n    title = "On the relation between concavity cuts and the surrogate dual for convex maximization problems",\n    journal = "J. Glob. Optim.",\n    volume = "52",\n    number = "3",\n    pages = "411--421",\n    year = "2012",\n    url = "https://doi.org/10.1007/s10898-011-9748-4",\n    doi = "10.1007/S10898-011-9748-4",\n    timestamp = "Fri, 11 Sep 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/jgo/LocatelliS12.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A concave optimization-based approach for sparse portfolio selection.\n \n \n \n \n\n\n \n Lorenzo, D. D.; Liuzzi, G.; Rinaldi, F.; Schoen, F.; and Sciandrone, M.\n\n\n \n\n\n\n Optim. Methods Softw., 27(6): 983–1000. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/oms/LorenzoLRSS12,\n    author = "Lorenzo, David Di and Liuzzi, Giampaolo and Rinaldi, Francesco and Schoen, Fabio and Sciandrone, Marco",\n    title = "A concave optimization-based approach for sparse portfolio selection",\n    journal = "Optim. Methods Softw.",\n    volume = "27",\n    number = "6",\n    pages = "983--1000",\n    year = "2012",\n    url = "https://doi.org/10.1080/10556788.2011.577773",\n    doi = "10.1080/10556788.2011.577773",\n    timestamp = "Thu, 24 Sep 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/oms/LorenzoLRSS12.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2011\n \n \n (9)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A New Feasibility Pump-Like Heuristic for Mixed Integer Problems.\n \n \n \n \n\n\n \n Santis, M. D.; Lucidi, S.; and Rinaldi, F.\n\n\n \n\n\n\n In Adacher, L.; Flamini, M.; Leo, G.; Nicosia, G.; Pacifici, A.; and Piccialli, V., editor(s), Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, Villa Mondragone, Frascati, Italy, June 14-16, 2011, pages 138–141, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/colognetwente/SantisLR11,\n    author = "Santis, Marianna De and Lucidi, Stefano and Rinaldi, Francesco",\n    editor = "Adacher, Ludovica and Flamini, Marta and Leo, Gianmaria and Nicosia, Gaia and Pacifici, Andrea and Piccialli, Veronica",\n    title = "A New Feasibility Pump-Like Heuristic for Mixed Integer Problems",\n    booktitle = "Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, Villa Mondragone, Frascati, Italy, June 14-16, 2011",\n    pages = "138--141",\n    year = "2011",\n    url = "http://ctw2011.dia.uniroma3.it/ctw\\\\_proceedings.pdf\\\\#page=150",\n    timestamp = "Thu, 12 Mar 2020 11:34:41 +0100",\n    biburl = "https://dblp.org/rec/conf/colognetwente/SantisLR11.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Continuous Reformulations for Zero-one Programming Problems.\n \n \n \n \n\n\n \n Santis, M. D.; Lucidi, S.; and Rinaldi, F.\n\n\n \n\n\n\n In Adacher, L.; Flamini, M.; Leo, G.; Nicosia, G.; Pacifici, A.; and Piccialli, V., editor(s), Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, Villa Mondragone, Frascati, Italy, June 14-16, 2011, pages 142–145, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"ContinuousPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/colognetwente/SantisLR11a,\n    author = "Santis, Marianna De and Lucidi, Stefano and Rinaldi, Francesco",\n    editor = "Adacher, Ludovica and Flamini, Marta and Leo, Gianmaria and Nicosia, Gaia and Pacifici, Andrea and Piccialli, Veronica",\n    title = "Continuous Reformulations for Zero-one Programming Problems",\n    booktitle = "Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, Villa Mondragone, Frascati, Italy, June 14-16, 2011",\n    pages = "142--145",\n    year = "2011",\n    url = "http://ctw2011.dia.uniroma3.it/ctw\\\\_proceedings.pdf\\\\#page=154",\n    timestamp = "Sat, 15 Oct 2011 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/conf/colognetwente/SantisLR11a.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Efficient link scheduling for online admission control of real-time traffic in wireless mesh networks.\n \n \n \n \n\n\n \n Cappanera, P.; Lenzini, L.; Lori, A.; Stea, G.; and Vaglini, G.\n\n\n \n\n\n\n Comput. Commun., 34(8): 922–934. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"EfficientPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/comcom/CappaneraLLSV11,\n    author = "Cappanera, Paola and Lenzini, Luciano and Lori, Alessandro and Stea, Giovanni and Vaglini, Gigliola",\n    title = "Efficient link scheduling for online admission control of real-time traffic in wireless mesh networks",\n    journal = "Comput. Commun.",\n    volume = "34",\n    number = "8",\n    pages = "922--934",\n    year = "2011",\n    url = "https://doi.org/10.1016/j.comcom.2011.02.004",\n    doi = "10.1016/J.COMCOM.2011.02.004",\n    timestamp = "Thu, 20 Feb 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/comcom/CappaneraLLSV11.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Color-Coding Algorithms to the Balanced Path Problem: Computational Issues.\n \n \n \n \n\n\n \n Cappanera, P.; and Scutellà, M. G.\n\n\n \n\n\n\n INFORMS J. Comput., 23(3): 446–459. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"Color-CodingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/informs/CappaneraS11,\n    author = "Cappanera, Paola and Scutell{\\`{a}}, Maria Grazia",\n    title = "Color-Coding Algorithms to the Balanced Path Problem: Computational Issues",\n    journal = "{INFORMS} J. Comput.",\n    volume = "23",\n    number = "3",\n    pages = "446--459",\n    year = "2011",\n    url = "https://doi.org/10.1287/ijoc.1100.0410",\n    doi = "10.1287/IJOC.1100.0410",\n    timestamp = "Sun, 15 Mar 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/informs/CappaneraS11.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Optimal Allocation of Protective Resources in Shortest-Path Networks.\n \n \n \n \n\n\n \n Cappanera, P.; and Scaparra, M. P.\n\n\n \n\n\n\n Transp. Sci., 45(1): 64–80. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"OptimalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/transci/CappaneraS11,\n    author = "Cappanera, Paola and Scaparra, Maria Paola",\n    title = "Optimal Allocation of Protective Resources in Shortest-Path Networks",\n    journal = "Transp. Sci.",\n    volume = "45",\n    number = "1",\n    pages = "64--80",\n    year = "2011",\n    url = "https://doi.org/10.1287/trsc.1100.0340",\n    doi = "10.1287/TRSC.1100.0340",\n    timestamp = "Tue, 08 Sep 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/transci/CappaneraS11.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The gateway location problem for hazardous material transportation.\n \n \n \n \n\n\n \n Bruglieri, M.; Cappanera, P.; and Nonato, M.\n\n\n \n\n\n\n In Adacher, L.; Flamini, M.; Leo, G.; Nicosia, G.; Pacifici, A.; and Piccialli, V., editor(s), Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, Villa Mondragone, Frascati, Italy, June 14-16, 2011, pages 88–92, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/colognetwente/BruglieriCN11,\n    author = "Bruglieri, Maurizio and Cappanera, Paola and Nonato, Maddalena",\n    editor = "Adacher, Ludovica and Flamini, Marta and Leo, Gianmaria and Nicosia, Gaia and Pacifici, Andrea and Piccialli, Veronica",\n    title = "The gateway location problem for hazardous material transportation",\n    booktitle = "Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, Villa Mondragone, Frascati, Italy, June 14-16, 2011",\n    pages = "88--92",\n    year = "2011",\n    url = "http://ctw2011.dia.uniroma3.it/ctw\\\\_proceedings.pdf\\\\#page=100",\n    timestamp = "Thu, 12 Mar 2020 11:34:41 +0100",\n    biburl = "https://dblp.org/rec/conf/colognetwente/BruglieriCN11.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Modeling the Gateway Location Problem for Multicommodity Flow Rerouting.\n \n \n \n \n\n\n \n Bruglieri, M.; Cappanera, P.; Colorni, A.; and Nonato, M.\n\n\n \n\n\n\n In Pahl, J.; Reiners, T.; and Voß, S., editor(s), Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011. Proceedings, volume 6701, of Lecture Notes in Computer Science, pages 262–276, 2011. Springer\n \n\n\n\n
\n\n\n\n \n \n \"ModelingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/inoc/BruglieriCCN11,\n    author = "Bruglieri, Maurizio and Cappanera, Paola and Colorni, Alberto and Nonato, Maddalena",\n    editor = "Pahl, Julia and Reiners, Torsten and Vo{\\ss}, Stefan",\n    title = "Modeling the Gateway Location Problem for Multicommodity Flow Rerouting",\n    booktitle = "Network Optimization - 5th International Conference, {INOC} 2011, Hamburg, Germany, June 13-16, 2011. Proceedings",\n    series = "Lecture Notes in Computer Science",\n    volume = "6701",\n    pages = "262--276",\n    publisher = "Springer",\n    year = "2011",\n    url = "https://doi.org/10.1007/978-3-642-21527-8\\\\_31",\n    doi = "10.1007/978-3-642-21527-8\\\\_31",\n    timestamp = "Fri, 16 Feb 2024 11:29:47 +0100",\n    biburl = "https://dblp.org/rec/conf/inoc/BruglieriCCN11.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Skill Vehicle Routing Problem.\n \n \n \n \n\n\n \n Cappanera, P.; Gouveia, L. E. N.; and Scutellà, M. G.\n\n\n \n\n\n\n In Pahl, J.; Reiners, T.; and Voß, S., editor(s), Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011. Proceedings, volume 6701, of Lecture Notes in Computer Science, pages 354–364, 2011. Springer\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/inoc/CappaneraGS11,\n    author = "Cappanera, Paola and Gouveia, Luis Eduardo Neves and Scutell{\\`{a}}, Maria Grazia",\n    editor = "Pahl, Julia and Reiners, Torsten and Vo{\\ss}, Stefan",\n    title = "The Skill Vehicle Routing Problem",\n    booktitle = "Network Optimization - 5th International Conference, {INOC} 2011, Hamburg, Germany, June 13-16, 2011. Proceedings",\n    series = "Lecture Notes in Computer Science",\n    volume = "6701",\n    pages = "354--364",\n    publisher = "Springer",\n    year = "2011",\n    url = "https://doi.org/10.1007/978-3-642-21527-8\\\\_40",\n    doi = "10.1007/978-3-642-21527-8\\\\_40",\n    timestamp = "Mon, 21 Sep 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/conf/inoc/CappaneraGS11.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A global optimization method for the design of space trajectories.\n \n \n \n \n\n\n \n Addis, B.; Cassioli, A.; Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n Comput. Optim. Appl., 48(3): 635–652. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/coap/AddisCLS11,\n    author = "Addis, Bernardetta and Cassioli, Andrea and Locatelli, Marco and Schoen, Fabio",\n    title = "A global optimization method for the design of space trajectories",\n    journal = "Comput. Optim. Appl.",\n    volume = "48",\n    number = "3",\n    pages = "635--652",\n    year = "2011",\n    url = "https://doi.org/10.1007/s10589-009-9261-6",\n    doi = "10.1007/S10589-009-9261-6",\n    timestamp = "Sat, 02 Sep 2023 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/coap/AddisCLS11.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2010\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Optimal link scheduling for real-time traffic in wireless mesh networks in both per-flow and per-path frameworks.\n \n \n \n \n\n\n \n Cappanera, P.; Lenzini, L.; Lori, A.; Stea, G.; and Vaglini, G.\n\n\n \n\n\n\n In 11th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WOWMOM 2010, Montreal, QC, Canada, 14-17 June, 2010, pages 1–9, 2010. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"OptimalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/wowmom/CappaneraLLSV10,\n    author = "Cappanera, Paola and Lenzini, Luciano and Lori, Alessandro and Stea, Giovanni and Vaglini, Gigliola",\n    title = "Optimal link scheduling for real-time traffic in wireless mesh networks in both per-flow and per-path frameworks",\n    booktitle = "11th {IEEE} International Symposium on a World of Wireless, Mobile and Multimedia Networks, {WOWMOM} 2010, Montreal, QC, Canada, 14-17 June, 2010",\n    pages = "1--9",\n    publisher = "{IEEE} Computer Society",\n    year = "2010",\n    url = "https://doi.org/10.1109/WOWMOM.2010.5534919",\n    doi = "10.1109/WOWMOM.2010.5534919",\n    timestamp = "Fri, 24 Mar 2023 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/conf/wowmom/CappaneraLLSV10.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Dissimilarity measures for population-based global optimization algorithms.\n \n \n \n \n\n\n \n Cassioli, A.; Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n Comput. Optim. Appl., 45(2): 257–281. 2010.\n \n\n\n\n
\n\n\n\n \n \n \"DissimilarityPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/coap/CassioliLS10,\n    author = "Cassioli, Andrea and Locatelli, Marco and Schoen, Fabio",\n    title = "Dissimilarity measures for population-based global optimization algorithms",\n    journal = "Comput. Optim. Appl.",\n    volume = "45",\n    number = "2",\n    pages = "257--281",\n    year = "2010",\n    url = "https://doi.org/10.1007/s10589-008-9194-5",\n    doi = "10.1007/S10589-008-9194-5",\n    timestamp = "Tue, 14 Jul 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/coap/CassioliLS10.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Concave programming for minimizing the zero-norm over polyhedral sets.\n \n \n \n \n\n\n \n Rinaldi, F.; Schoen, F.; and Sciandrone, M.\n\n\n \n\n\n\n Comput. Optim. Appl., 46(3): 467–486. 2010.\n \n\n\n\n
\n\n\n\n \n \n \"ConcavePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/coap/RinaldiSS10,\n    author = "Rinaldi, Francesco and Schoen, Fabio and Sciandrone, Marco",\n    title = "Concave programming for minimizing the zero-norm over polyhedral sets",\n    journal = "Comput. Optim. Appl.",\n    volume = "46",\n    number = "3",\n    pages = "467--486",\n    year = "2010",\n    url = "https://doi.org/10.1007/s10589-008-9202-9",\n    doi = "10.1007/S10589-008-9202-9",\n    timestamp = "Tue, 14 Jul 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/coap/RinaldiSS10.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Solving the problem of packing equal and unequal circles in a circular container.\n \n \n \n \n\n\n \n Grosso, A.; Jamali, A. R. M. J. U.; Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n J. Glob. Optim., 47(1): 63–81. 2010.\n \n\n\n\n
\n\n\n\n \n \n \"SolvingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jgo/GrossoJLS10,\n    author = "Grosso, Andrea and Jamali, A. R. M. J. U. and Locatelli, Marco and Schoen, Fabio",\n    title = "Solving the problem of packing equal and unequal circles in a circular container",\n    journal = "J. Glob. Optim.",\n    volume = "47",\n    number = "1",\n    pages = "63--81",\n    year = "2010",\n    url = "https://doi.org/10.1007/s10898-009-9458-3",\n    doi = "10.1007/S10898-009-9458-3",\n    timestamp = "Fri, 11 Sep 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/jgo/GrossoJLS10.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2009\n \n \n (7)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Link scheduling with end-to-end delay constraints in Wireless Mesh Networks.\n \n \n \n \n\n\n \n Cappanera, P.; Lenzini, L.; Lori, A.; Stea, G.; and Vaglini, G.\n\n\n \n\n\n\n In 10th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WOWMOM 2009, Kos Island, Greece, 15-19 June, 2009, pages 1–9, 2009. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"LinkPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/wowmom/CappaneraLLSV09,\n    author = "Cappanera, Paola and Lenzini, Luciano and Lori, Alessandro and Stea, Giovanni and Vaglini, Gigliola",\n    title = "Link scheduling with end-to-end delay constraints in Wireless Mesh Networks",\n    booktitle = "10th {IEEE} International Symposium on a World of Wireless, Mobile and Multimedia Networks, {WOWMOM} 2009, Kos Island, Greece, 15-19 June, 2009",\n    pages = "1--9",\n    publisher = "{IEEE} Computer Society",\n    year = "2009",\n    url = "https://doi.org/10.1109/WOWMOM.2009.5282472",\n    doi = "10.1109/WOWMOM.2009.5282472",\n    timestamp = "Fri, 24 Mar 2023 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/conf/wowmom/CappaneraLLSV09.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the complexity of some subgraph problems.\n \n \n \n \n\n\n \n Scozzari, A.; and Tardella, F.\n\n\n \n\n\n\n Discret. Appl. Math., 157(17): 3531–3539. 2009.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/dam/ScozzariT09,\n    author = "Scozzari, Andrea and Tardella, Fabio",\n    title = "On the complexity of some subgraph problems",\n    journal = "Discret. Appl. Math.",\n    volume = "157",\n    number = "17",\n    pages = "3531--3539",\n    year = "2009",\n    url = "https://doi.org/10.1016/j.dam.2009.04.003",\n    doi = "10.1016/J.DAM.2009.04.003",\n    timestamp = "Thu, 11 Feb 2021 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/dam/ScozzariT09.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Complexity of Graph-Based Bounds for the Probability Bounding Problem.\n \n \n \n \n\n\n \n Scozzari, A.; and Tardella, F.\n\n\n \n\n\n\n In Cafieri, S.; Mucherino, A.; Nannicini, G.; Tarissan, F.; and Liberti, L., editor(s), Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009, pages 235–238, 2009. \n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/colognetwente/ScozzariT09,\n    author = "Scozzari, Andrea and Tardella, Fabio",\n    editor = "Cafieri, Sonia and Mucherino, Antonio and Nannicini, Giacomo and Tarissan, Fabien and Liberti, Leo",\n    title = "On the Complexity of Graph-Based Bounds for the Probability Bounding Problem",\n    booktitle = "Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, {CTW} 2009, Paris, France, June 2-4 2009",\n    pages = "235--238",\n    year = "2009",\n    url = "http://www.lix.polytechnique.fr/ctw09/ctw09-proceedings.pdf\\\\#page=247",\n    timestamp = "Thu, 12 Mar 2020 11:34:41 +0100",\n    biburl = "https://dblp.org/rec/conf/colognetwente/ScozzariT09.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Solving molecular distance geometry problems by global optimization algorithms.\n \n \n \n \n\n\n \n Grosso, A.; Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n Comput. Optim. Appl., 43(1): 23–37. 2009.\n \n\n\n\n
\n\n\n\n \n \n \"SolvingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/coap/GrossoLS09,\n    author = "Grosso, Andrea and Locatelli, Marco and Schoen, Fabio",\n    title = "Solving molecular distance geometry problems by global optimization algorithms",\n    journal = "Comput. Optim. Appl.",\n    volume = "43",\n    number = "1",\n    pages = "23--37",\n    year = "2009",\n    url = "https://doi.org/10.1007/s10589-007-9127-8",\n    doi = "10.1007/S10589-007-9127-8",\n    timestamp = "Tue, 14 Jul 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/coap/GrossoLS09.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Global optimization of binary Lennard-Jones clusters.\n \n \n \n \n\n\n \n Cassioli, A.; Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n Optim. Methods Softw., 24(4-5): 819–835. 2009.\n \n\n\n\n
\n\n\n\n \n \n \"GlobalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/oms/CassioliLS09,\n    author = "Cassioli, Andrea and Locatelli, Marco and Schoen, Fabio",\n    title = "Global optimization of binary Lennard-Jones clusters",\n    journal = "Optim. Methods Softw.",\n    volume = "24",\n    number = "4-5",\n    pages = "819--835",\n    year = "2009",\n    url = "https://doi.org/10.1080/10556780802614101",\n    doi = "10.1080/10556780802614101",\n    timestamp = "Thu, 24 Sep 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/oms/CassioliLS09.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Stochastic Global Optimization: Stopping Rules.\n \n \n \n \n\n\n \n Schoen, F.\n\n\n \n\n\n\n In Floudas, C. A.; and Pardalos, P. M., editor(s), Encyclopedia of Optimization, Second Edition, pages 3743–3746. Springer, 2009.\n \n\n\n\n
\n\n\n\n \n \n \"StochasticPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@incollection{DBLP:reference/opt/Schoen09,\n    author = "Schoen, Fabio",\n    editor = "Floudas, Christodoulos A. and Pardalos, Panos M.",\n    title = "Stochastic Global Optimization: Stopping Rules",\n    booktitle = "Encyclopedia of Optimization, Second Edition",\n    pages = "3743--3746",\n    publisher = "Springer",\n    year = "2009",\n    url = "https://doi.org/10.1007/978-0-387-74759-0\\\\_647",\n    doi = "10.1007/978-0-387-74759-0\\\\_647",\n    timestamp = "Wed, 12 Jul 2017 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/reference/opt/Schoen09.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Stochastic Global Optimization: Two-Phase Methods.\n \n \n \n \n\n\n \n Schoen, F.\n\n\n \n\n\n\n In Floudas, C. A.; and Pardalos, P. M., editor(s), Encyclopedia of Optimization, Second Edition, pages 3746–3750. Springer, 2009.\n \n\n\n\n
\n\n\n\n \n \n \"StochasticPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@incollection{DBLP:reference/opt/Schoen09a,\n    author = "Schoen, Fabio",\n    editor = "Floudas, Christodoulos A. and Pardalos, Panos M.",\n    title = "Stochastic Global Optimization: Two-Phase Methods",\n    booktitle = "Encyclopedia of Optimization, Second Edition",\n    pages = "3746--3750",\n    publisher = "Springer",\n    year = "2009",\n    url = "https://doi.org/10.1007/978-0-387-74759-0\\\\_648",\n    doi = "10.1007/978-0-387-74759-0\\\\_648",\n    timestamp = "Wed, 12 Jul 2017 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/reference/opt/Schoen09a.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2008\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A clique algorithm for standard quadratic programming.\n \n \n \n \n\n\n \n Scozzari, A.; and Tardella, F.\n\n\n \n\n\n\n Discret. Appl. Math., 156(13): 2439–2448. 2008.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/dam/ScozzariT08,\n    author = "Scozzari, Andrea and Tardella, Fabio",\n    title = "A clique algorithm for standard quadratic programming",\n    journal = "Discret. Appl. Math.",\n    volume = "156",\n    number = "13",\n    pages = "2439--2448",\n    year = "2008",\n    url = "https://doi.org/10.1016/j.dam.2007.09.020",\n    doi = "10.1016/J.DAM.2007.09.020",\n    timestamp = "Thu, 11 Feb 2021 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/dam/ScozzariT08.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Sublattices of product spaces: Hulls, representations and counting.\n \n \n \n \n\n\n \n Queyranne, M.; and Tardella, F.\n\n\n \n\n\n\n Discret. Math., 308(9): 1508–1523. 2008.\n \n\n\n\n
\n\n\n\n \n \n \"SublatticesPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/dm/QueyranneT08,\n    author = "Queyranne, Maurice and Tardella, Fabio",\n    title = "Sublattices of product spaces: Hulls, representations and counting",\n    journal = "Discret. Math.",\n    volume = "308",\n    number = "9",\n    pages = "1508--1523",\n    year = "2008",\n    url = "https://doi.org/10.1016/j.disc.2007.03.080",\n    doi = "10.1016/J.DISC.2007.03.080",\n    timestamp = "Fri, 12 Feb 2021 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/dm/QueyranneT08.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability.\n \n \n \n \n\n\n \n Bomze, I. M.; Locatelli, M.; and Tardella, F.\n\n\n \n\n\n\n Math. Program., 115(1): 31–64. 2008.\n \n\n\n\n
\n\n\n\n \n \n \"NewPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/mp/BomzeLT08,\n    author = "Bomze, Immanuel M. and Locatelli, Marco and Tardella, Fabio",\n    title = "New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability",\n    journal = "Math. Program.",\n    volume = "115",\n    number = "1",\n    pages = "31--64",\n    year = "2008",\n    url = "https://doi.org/10.1007/s10107-007-0138-0",\n    doi = "10.1007/S10107-007-0138-0",\n    timestamp = "Sat, 05 Sep 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/mp/BomzeLT08.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Existence and sum decomposition of vertex polyhedral convex envelopes.\n \n \n \n \n\n\n \n Tardella, F.\n\n\n \n\n\n\n Optim. Lett., 2(3): 363–375. 2008.\n \n\n\n\n
\n\n\n\n \n \n \"ExistencePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/ol/Tardella08,\n    author = "Tardella, Fabio",\n    title = "Existence and sum decomposition of vertex polyhedral convex envelopes",\n    journal = "Optim. Lett.",\n    volume = "2",\n    number = "3",\n    pages = "363--375",\n    year = "2008",\n    url = "https://doi.org/10.1007/s11590-007-0065-2",\n    doi = "10.1007/S11590-007-0065-2",\n    timestamp = "Fri, 03 Jul 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/ol/Tardella08.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Disk Packing in a Square: A New Global Optimization Approach.\n \n \n \n \n\n\n \n Addis, B.; Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n INFORMS J. Comput., 20(4): 516–524. 2008.\n \n\n\n\n
\n\n\n\n \n \n \"DiskPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/informs/AddisLS08,\n    author = "Addis, Bernardetta and Locatelli, Marco and Schoen, Fabio",\n    title = "Disk Packing in a Square: {A} New Global Optimization Approach",\n    journal = "{INFORMS} J. Comput.",\n    volume = "20",\n    number = "4",\n    pages = "516--524",\n    year = "2008",\n    url = "https://doi.org/10.1287/ijoc.1080.0263",\n    doi = "10.1287/IJOC.1080.0263",\n    timestamp = "Sat, 02 Sep 2023 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/informs/AddisLS08.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Efficiently packing unequal disks in a circle.\n \n \n \n \n\n\n \n Addis, B.; Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n Oper. Res. Lett., 36(1): 37–42. 2008.\n \n\n\n\n
\n\n\n\n \n \n \"EfficientlyPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/orl/AddisLS08,\n    author = "Addis, Bernardetta and Locatelli, Marco and Schoen, Fabio",\n    title = "Efficiently packing unequal disks in a circle",\n    journal = "Oper. Res. Lett.",\n    volume = "36",\n    number = "1",\n    pages = "37--42",\n    year = "2008",\n    url = "https://doi.org/10.1016/j.orl.2007.03.001",\n    doi = "10.1016/J.ORL.2007.03.001",\n    timestamp = "Sat, 02 Sep 2023 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/orl/AddisLS08.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2007\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n New results for molecular formation under pairwise potential minimization.\n \n \n \n \n\n\n \n Schachinger, W.; Addis, B.; Bomze, I. M.; and Schoen, F.\n\n\n \n\n\n\n Comput. Optim. Appl., 38(3): 329–349. 2007.\n \n\n\n\n
\n\n\n\n \n \n \"NewPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/coap/SchachingerABS07,\n    author = "Schachinger, Werner and Addis, Bernardetta and Bomze, Immanuel M. and Schoen, Fabio",\n    title = "New results for molecular formation under pairwise potential minimization",\n    journal = "Comput. Optim. Appl.",\n    volume = "38",\n    number = "3",\n    pages = "329--349",\n    year = "2007",\n    url = "https://doi.org/10.1007/s10589-007-9051-y",\n    doi = "10.1007/S10589-007-9051-Y",\n    timestamp = "Sat, 02 Sep 2023 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/coap/SchachingerABS07.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An experimental analysis of a population based approach for global optimization.\n \n \n \n \n\n\n \n Grosso, A.; Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n Comput. Optim. Appl., 38(3): 351–370. 2007.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/coap/GrossoLS07,\n    author = "Grosso, Andrea and Locatelli, Marco and Schoen, Fabio",\n    title = "An experimental analysis of a population based approach for global optimization",\n    journal = "Comput. Optim. Appl.",\n    volume = "38",\n    number = "3",\n    pages = "351--370",\n    year = "2007",\n    url = "https://doi.org/10.1007/s10589-007-9026-z",\n    doi = "10.1007/S10589-007-9026-Z",\n    timestamp = "Tue, 14 Jul 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/coap/GrossoLS07.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures.\n \n \n \n \n\n\n \n Grosso, A.; Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n Math. Program., 110(2): 373–404. 2007.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/mp/GrossoLS07,\n    author = "Grosso, Andrea and Locatelli, Marco and Schoen, Fabio",\n    title = "A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures",\n    journal = "Math. Program.",\n    volume = "110",\n    number = "2",\n    pages = "373--404",\n    year = "2007",\n    url = "https://doi.org/10.1007/s10107-006-0006-3",\n    doi = "10.1007/S10107-006-0006-3",\n    timestamp = "Tue, 07 May 2019 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/mp/GrossoLS07.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2005\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem.\n \n \n \n \n\n\n \n Cappanera, P.; and Trubian, M.\n\n\n \n\n\n\n INFORMS J. Comput., 17(1): 82–98. 2005.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/informs/CappaneraT05,\n    author = "Cappanera, Paola and Trubian, Marco",\n    title = "A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem",\n    journal = "{INFORMS} J. Comput.",\n    volume = "17",\n    number = "1",\n    pages = "82--98",\n    year = "2005",\n    url = "https://doi.org/10.1287/ijoc.1030.0050",\n    doi = "10.1287/IJOC.1030.0050",\n    timestamp = "Sun, 15 Mar 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/informs/CappaneraT05.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Balanced paths in acyclic networks: Tractable cases and related approaches.\n \n \n \n \n\n\n \n Cappanera, P.; and Scutellà, M. G.\n\n\n \n\n\n\n Networks, 45(2): 104–111. 2005.\n \n\n\n\n
\n\n\n\n \n \n \"BalancedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/networks/CappaneraS05,\n    author = "Cappanera, Paola and Scutell{\\`{a}}, Maria Grazia",\n    title = "Balanced paths in acyclic networks: Tractable cases and related approaches",\n    journal = "Networks",\n    volume = "45",\n    number = "2",\n    pages = "104--111",\n    year = "2005",\n    url = "https://doi.org/10.1002/net.20053",\n    doi = "10.1002/NET.20053",\n    timestamp = "Thu, 08 Jun 2017 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/networks/CappaneraS05.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Local optima smoothing for global optimization.\n \n \n \n \n\n\n \n Addis, B.; Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n Optim. Methods Softw., 20(4-5): 417–437. 2005.\n \n\n\n\n
\n\n\n\n \n \n \"LocalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/oms/AddisLS05,\n    author = "Addis, Bernardetta and Locatelli, Marco and Schoen, Fabio",\n    title = "Local optima smoothing for global optimization",\n    journal = "Optim. Methods Softw.",\n    volume = "20",\n    number = "4-5",\n    pages = "417--437",\n    year = "2005",\n    url = "https://doi.org/10.1080/10556780500140029",\n    doi = "10.1080/10556780500140029",\n    timestamp = "Sat, 02 Sep 2023 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/oms/AddisLS05.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2004\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A Multicommodity Flow Approach to the Crew Rostering Problem.\n \n \n \n \n\n\n \n Cappanera, P.; and Gallo, G.\n\n\n \n\n\n\n Oper. Res., 52(4): 583–596. 2004.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/ior/CappaneraG04,\n    author = "Cappanera, Paola and Gallo, Giorgio",\n    title = "A Multicommodity Flow Approach to the Crew Rostering Problem",\n    journal = "Oper. Res.",\n    volume = "52",\n    number = "4",\n    pages = "583--596",\n    year = "2004",\n    url = "https://doi.org/10.1287/opre.1040.0110",\n    doi = "10.1287/OPRE.1040.0110",\n    timestamp = "Tue, 31 Mar 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/ior/CappaneraG04.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming.\n \n \n \n \n\n\n \n Tardella, F.\n\n\n \n\n\n\n Electron. Notes Discret. Math., 17: 257–262. 2004.\n \n\n\n\n
\n\n\n\n \n \n \"ConnectionsPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/endm/Tardella04,\n    author = "Tardella, Fabio",\n    title = "Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming",\n    journal = "Electron. Notes Discret. Math.",\n    volume = "17",\n    pages = "257--262",\n    year = "2004",\n    url = "https://doi.org/10.1016/j.endm.2004.03.054",\n    doi = "10.1016/J.ENDM.2004.03.054",\n    timestamp = "Thu, 20 Feb 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/endm/Tardella04.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Connections between Continuous and Combinatorial Optimization Problems through an Extension of the Fundamental Theorem of Linear Programming.\n \n \n \n\n\n \n Tardella, F.\n\n\n \n\n\n\n In Liberti, L.; and Maffioli, F., editor(s), CTW04 Workshop on Graphs and Combinatorial Optimization, Scientific Program, Villa Vigoni, Menaggio (CO), Italy, 31st May to 2nd June 2004, pages 223–227, 2004. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/colognetwente/Tardella04,\n    author = "Tardella, Fabio",\n    editor = "Liberti, Leo and Maffioli, Francesco",\n    title = "Connections between Continuous and Combinatorial Optimization Problems through an Extension of the Fundamental Theorem of Linear Programming",\n    booktitle = "{CTW04} Workshop on Graphs and Combinatorial Optimization, Scientific Program, Villa Vigoni, Menaggio (CO), Italy, 31st May to 2nd June 2004",\n    pages = "223--227",\n    year = "2004",\n    timestamp = "Tue, 09 Nov 2010 19:23:16 +0100",\n    biburl = "https://dblp.org/rec/conf/colognetwente/Tardella04.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Global Optimization of Morse Clusters by Potential Energy Transformations.\n \n \n \n \n\n\n \n Doye, J. P. K.; Leary, R. H.; Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n INFORMS J. Comput., 16(4): 371–379. 2004.\n \n\n\n\n
\n\n\n\n \n \n \"GlobalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/informs/DoyeLLS04,\n    author = "Doye, Jonathan P. K. and Leary, Robert H. and Locatelli, Marco and Schoen, Fabio",\n    title = "Global Optimization of Morse Clusters by Potential Energy Transformations",\n    journal = "{INFORMS} J. Comput.",\n    volume = "16",\n    number = "4",\n    pages = "371--379",\n    year = "2004",\n    url = "https://doi.org/10.1287/ijoc.1040.0084",\n    doi = "10.1287/IJOC.1040.0084",\n    timestamp = "Sun, 15 Mar 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/informs/DoyeLLS04.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Docking of Atomic Clusters Through Nonlinear Optimization.\n \n \n \n \n\n\n \n Addis, B.; and Schoen, F.\n\n\n \n\n\n\n J. Glob. Optim., 30(1): 1–21. 2004.\n \n\n\n\n
\n\n\n\n \n \n \"DockingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jgo/AddisS04,\n    author = "Addis, Bernardetta and Schoen, Fabio",\n    title = "Docking of Atomic Clusters Through Nonlinear Optimization",\n    journal = "J. Glob. Optim.",\n    volume = "30",\n    number = "1",\n    pages = "1--21",\n    year = "2004",\n    url = "https://doi.org/10.1023/B:JOGO.0000049103.34724.62",\n    doi = "10.1023/B:JOGO.0000049103.34724.62",\n    timestamp = "Sat, 02 Sep 2023 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/jgo/AddisS04.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2003\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Discrete facility location and routing of obnoxious activities.\n \n \n \n \n\n\n \n Cappanera, P.; Gallo, G.; and Maffioli, F.\n\n\n \n\n\n\n Discret. Appl. Math., 133(1-3): 3–28. 2003.\n \n\n\n\n
\n\n\n\n \n \n \"DiscretePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/dam/CappaneraGM03,\n    author = "Cappanera, Paola and Gallo, Giorgio and Maffioli, Francesco",\n    title = "Discrete facility location and routing of obnoxious activities",\n    journal = "Discret. Appl. Math.",\n    volume = "133",\n    number = "1-3",\n    pages = "3--28",\n    year = "2003",\n    url = "https://doi.org/10.1016/S0166-218X(03)00431-1",\n    doi = "10.1016/S0166-218X(03)00431-1",\n    timestamp = "Thu, 11 Feb 2021 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/dam/CappaneraGM03.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Symmetric and Asymmetric Parallelization of a Cost-Decomposition Algorithm for Multicommodity Flow Problems.\n \n \n \n \n\n\n \n Cappanera, P.; and Frangioni, A.\n\n\n \n\n\n\n INFORMS J. Comput., 15(4): 369–384. 2003.\n \n\n\n\n
\n\n\n\n \n \n \"SymmetricPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/informs/CappaneraF03,\n    author = "Cappanera, Paola and Frangioni, Antonio",\n    title = "Symmetric and Asymmetric Parallelization of a Cost-Decomposition Algorithm for Multicommodity Flow Problems",\n    journal = "{INFORMS} J. Comput.",\n    volume = "15",\n    number = "4",\n    pages = "369--384",\n    year = "2003",\n    url = "https://doi.org/10.1287/ijoc.15.4.369.24887",\n    doi = "10.1287/IJOC.15.4.369.24887",\n    timestamp = "Mon, 28 Aug 2023 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/informs/CappaneraF03.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Efficient Algorithms for Large Scale Global Optimization: Lennard-Jones Clusters.\n \n \n \n \n\n\n \n Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n Comput. Optim. Appl., 26(2): 173–190. 2003.\n \n\n\n\n
\n\n\n\n \n \n \"EfficientPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/coap/LocatelliS03,\n    author = "Locatelli, Marco and Schoen, Fabio",\n    title = "Efficient Algorithms for Large Scale Global Optimization: Lennard-Jones Clusters",\n    journal = "Comput. Optim. Appl.",\n    volume = "26",\n    number = "2",\n    pages = "173--190",\n    year = "2003",\n    url = "https://doi.org/10.1023/A:1025798414605",\n    doi = "10.1023/A:1025798414605",\n    timestamp = "Tue, 14 Jul 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/coap/LocatelliS03.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2002\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Fast Global Optimization of Difficult Lennard-Jones Clusters.\n \n \n \n \n\n\n \n Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n Comput. Optim. Appl., 21(1): 55–70. 2002.\n \n\n\n\n
\n\n\n\n \n \n \"FastPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/coap/LocatelliS02,\n    author = "Locatelli, Marco and Schoen, Fabio",\n    title = "Fast Global Optimization of Difficult Lennard-Jones Clusters",\n    journal = "Comput. Optim. Appl.",\n    volume = "21",\n    number = "1",\n    pages = "55--70",\n    year = "2002",\n    url = "https://doi.org/10.1023/A:1013596313166",\n    doi = "10.1023/A:1013596313166",\n    timestamp = "Tue, 14 Jul 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/coap/LocatelliS02.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Minimal interatomic distance in Morse clusters.\n \n \n \n \n\n\n \n Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n J. Glob. Optim., 22(1-4): 175–190. 2002.\n \n\n\n\n
\n\n\n\n \n \n \"MinimalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jgo/LocatelliS02,\n    author = "Locatelli, Marco and Schoen, Fabio",\n    title = "Minimal interatomic distance in Morse clusters",\n    journal = "J. Glob. Optim.",\n    volume = "22",\n    number = "1-4",\n    pages = "175--190",\n    year = "2002",\n    url = "https://doi.org/10.1023/A:1013811230753",\n    doi = "10.1023/A:1013811230753",\n    timestamp = "Fri, 11 Sep 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/jgo/LocatelliS02.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2001\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A mathematical programming model for the bus deviation route problem.\n \n \n \n \n\n\n \n Pratelli, A.; and Schoen, F.\n\n\n \n\n\n\n J. Oper. Res. Soc., 52(5): 494–502. 2001.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jors/PratelliS01,\n    author = "Pratelli, Antonio and Schoen, Fabio",\n    title = "A mathematical programming model for the bus deviation route problem",\n    journal = "J. Oper. Res. Soc.",\n    volume = "52",\n    number = "5",\n    pages = "494--502",\n    year = "2001",\n    url = "https://doi.org/10.1057/palgrave.jors.2601109",\n    doi = "10.1057/PALGRAVE.JORS.2601109",\n    timestamp = "Thu, 14 Oct 2021 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/jors/PratelliS01.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1999\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Global optimization methods for high-dimensional problems.\n \n \n \n \n\n\n \n Schoen, F.\n\n\n \n\n\n\n Eur. J. Oper. Res., 119(2): 345–352. 1999.\n \n\n\n\n
\n\n\n\n \n \n \"GlobalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/eor/Schoen99,\n    author = "Schoen, Fabio",\n    title = "Global optimization methods for high-dimensional problems",\n    journal = "Eur. J. Oper. Res.",\n    volume = "119",\n    number = "2",\n    pages = "345--352",\n    year = "1999",\n    url = "https://doi.org/10.1016/S0377-2217(99)00136-8",\n    doi = "10.1016/S0377-2217(99)00136-8",\n    timestamp = "Fri, 21 Feb 2020 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/eor/Schoen99.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Random Linkage: a family of acceptance/rejection algorithms for global optimisation.\n \n \n \n \n\n\n \n Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n Math. Program., 85(2): 379–396. 1999.\n \n\n\n\n
\n\n\n\n \n \n \"RandomPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/mp/LocatelliS99,\n    author = "Locatelli, Marco and Schoen, Fabio",\n    title = "Random Linkage: a family of acceptance/rejection algorithms for global optimisation",\n    journal = "Math. Program.",\n    volume = "85",\n    number = "2",\n    pages = "379--396",\n    year = "1999",\n    url = "https://doi.org/10.1007/s101070050062",\n    doi = "10.1007/S101070050062",\n    timestamp = "Tue, 07 May 2019 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/mp/LocatelliS99.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1998\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A General Class of Greedily Solvable Linear Programs.\n \n \n \n \n\n\n \n Queyranne, M.; Spieksma, F. C. R.; and Tardella, F.\n\n\n \n\n\n\n Math. Oper. Res., 23(4): 892–908. 1998.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/mor/QueyranneST98,\n    author = "Queyranne, Maurice and Spieksma, Frits C. R. and Tardella, Fabio",\n    title = "A General Class of Greedily Solvable Linear Programs",\n    journal = "Math. Oper. Res.",\n    volume = "23",\n    number = "4",\n    pages = "892--908",\n    year = "1998",\n    url = "https://doi.org/10.1287/moor.23.4.892",\n    doi = "10.1287/MOOR.23.4.892",\n    timestamp = "Sun, 28 May 2017 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/mor/QueyranneST98.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Random and Quasi-Random Linkage Methods in Global Optimization.\n \n \n \n \n\n\n \n Schoen, F.\n\n\n \n\n\n\n J. Glob. Optim., 13(4): 445–454. 1998.\n \n\n\n\n
\n\n\n\n \n \n \"RandomPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jgo/Schoen98,\n    author = "Schoen, Fabio",\n    title = "Random and Quasi-Random Linkage Methods in Global Optimization",\n    journal = "J. Glob. Optim.",\n    volume = "13",\n    number = "4",\n    pages = "445--454",\n    year = "1998",\n    url = "https://doi.org/10.1023/A:1008354314309",\n    doi = "10.1023/A:1008354314309",\n    timestamp = "Fri, 11 Sep 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/jgo/Schoen98.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Computational Issues in High Performance Software for Nonlinear Optimization.\n \n \n \n \n\n\n \n Schoen, F.\n\n\n \n\n\n\n J. Oper. Res. Soc., 49(11): 1225. 1998.\n \n\n\n\n
\n\n\n\n \n \n \"ComputationalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jors/Schoen98,\n    author = "Schoen, Fabio",\n    title = "Computational Issues in High Performance Software for Nonlinear Optimization",\n    journal = "J. Oper. Res. Soc.",\n    volume = "49",\n    number = "11",\n    pages = "1225",\n    year = "1998",\n    url = "https://doi.org/10.1057/palgrave.jors.2600640",\n    doi = "10.1057/PALGRAVE.JORS.2600640",\n    timestamp = "Fri, 21 Aug 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/jors/Schoen98.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Numerica A Modeling Language for Global Optimisation.\n \n \n \n \n\n\n \n Schoen, F.\n\n\n \n\n\n\n J. Oper. Res. Soc., 49(11): 1228. 1998.\n \n\n\n\n
\n\n\n\n \n \n \"NumericaPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jors/Schoen98a,\n    author = "Schoen, Fabio",\n    title = "Numerica {A} Modeling Language for Global Optimisation",\n    journal = "J. Oper. Res. Soc.",\n    volume = "49",\n    number = "11",\n    pages = "1228",\n    year = "1998",\n    url = "https://doi.org/10.1057/palgrave.jors.2600041",\n    doi = "10.1057/PALGRAVE.JORS.2600041",\n    timestamp = "Fri, 21 Aug 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/jors/Schoen98a.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1996\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Simple linkage: Analysis of a threshold-accepting global optimization method.\n \n \n \n \n\n\n \n Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n J. Glob. Optim., 9(1): 95–111. 1996.\n \n\n\n\n
\n\n\n\n \n \n \"SimplePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jgo/LocatelliS96,\n    author = "Locatelli, Marco and Schoen, Fabio",\n    title = "Simple linkage: Analysis of a threshold-accepting global optimization method",\n    journal = "J. Glob. Optim.",\n    volume = "9",\n    number = "1",\n    pages = "95--111",\n    year = "1996",\n    url = "https://doi.org/10.1007/BF00121752",\n    doi = "10.1007/BF00121752",\n    timestamp = "Fri, 11 Sep 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/jgo/LocatelliS96.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1995\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n An adaptive stochastic global optimization algorithm for one-dimensional functions.\n \n \n \n \n\n\n \n Locatelli, M.; and Schoen, F.\n\n\n \n\n\n\n Ann. Oper. Res., 58(4): 261–278. 1995.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/anor/LocatelliS95,\n    author = "Locatelli, Marco and Schoen, Fabio",\n    title = "An adaptive stochastic global optimization algorithm for one-dimensional functions",\n    journal = "Ann. Oper. Res.",\n    volume = "58",\n    number = "4",\n    pages = "261--278",\n    year = "1995",\n    url = "https://doi.org/10.1007/BF02096402",\n    doi = "10.1007/BF02096402",\n    timestamp = "Thu, 13 Aug 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/anor/LocatelliS95.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1994\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On a new stochastic global optimization algorithm based on censored observations.\n \n \n \n \n\n\n \n Schoen, F.\n\n\n \n\n\n\n J. Glob. Optim., 4(1): 17–35. 1994.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jgo/Schoen94,\n    author = "Schoen, Fabio",\n    title = "On a new stochastic global optimization algorithm based on censored observations",\n    journal = "J. Glob. Optim.",\n    volume = "4",\n    number = "1",\n    pages = "17--35",\n    year = "1994",\n    url = "https://doi.org/10.1007/BF01096532",\n    doi = "10.1007/BF01096532",\n    timestamp = "Fri, 11 Sep 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/jgo/Schoen94.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1993\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n A general class of greedily solvable linear programs.\n \n \n \n\n\n \n Queyranne, M.; Spieksma, F. C. R.; and Tardella, F.\n\n\n \n\n\n\n In Rinaldi, G.; and Wolsey, L. A., editor(s), Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29 - May 1, 1993, pages 385–399, 1993. CIACO\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/ipco/QueyranneST93,\n    author = "Queyranne, Maurice and Spieksma, Frits C. R. and Tardella, Fabio",\n    editor = "Rinaldi, Giovanni and Wolsey, Laurence A.",\n    title = "A general class of greedily solvable linear programs",\n    booktitle = "Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29 - May 1, 1993",\n    pages = "385--399",\n    publisher = "{CIACO}",\n    year = "1993",\n    timestamp = "Wed, 09 Oct 2002 11:26:33 +0200",\n    biburl = "https://dblp.org/rec/conf/ipco/QueyranneST93.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A wide class of test functions for global optimization.\n \n \n \n \n\n\n \n Schoen, F.\n\n\n \n\n\n\n J. Glob. Optim., 3(2): 133–137. 1993.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jgo/Schoen93,\n    author = "Schoen, Fabio",\n    title = "A wide class of test functions for global optimization",\n    journal = "J. Glob. Optim.",\n    volume = "3",\n    number = "2",\n    pages = "133--137",\n    year = "1993",\n    url = "https://doi.org/10.1007/BF01096734",\n    doi = "10.1007/BF01096734",\n    timestamp = "Fri, 11 Sep 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/jgo/Schoen93.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1992\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Optimal and sub-optimal stopping rules for the Multistart algorithm in global optimization.\n \n \n \n \n\n\n \n Betrò, B.; and Schoen, F.\n\n\n \n\n\n\n Math. Program., 57: 445–458. 1992.\n \n\n\n\n
\n\n\n\n \n \n \"OptimalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/mp/BetroS92,\n    author = "Betr{\\`{o}}, Bruno and Schoen, Fabio",\n    title = "Optimal and sub-optimal stopping rules for the Multistart algorithm in global optimization",\n    journal = "Math. Program.",\n    volume = "57",\n    pages = "445--458",\n    year = "1992",\n    url = "https://doi.org/10.1007/BF01581094",\n    doi = "10.1007/BF01581094",\n    timestamp = "Thu, 08 Jun 2017 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/mp/BetroS92.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1991\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Stochastic techniques for global optimization: A survey of recent advances.\n \n \n \n \n\n\n \n Schoen, F.\n\n\n \n\n\n\n J. Glob. Optim., 1(3): 207–228. 1991.\n \n\n\n\n
\n\n\n\n \n \n \"StochasticPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jgo/Schoen91,\n    author = "Schoen, Fabio",\n    title = "Stochastic techniques for global optimization: {A} survey of recent advances",\n    journal = "J. Glob. Optim.",\n    volume = "1",\n    number = "3",\n    pages = "207--228",\n    year = "1991",\n    url = "https://doi.org/10.1007/BF00119932",\n    doi = "10.1007/BF00119932",\n    timestamp = "Fri, 11 Sep 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/jgo/Schoen91.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1989\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On a class of functions attaining their maximum at the vertices of a polyhedron.\n \n \n \n \n\n\n \n Tardella, F.\n\n\n \n\n\n\n Discret. Appl. Math., 22(2): 191–195. 1989.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/dam/Tardella89,\n    author = "Tardella, Fabio",\n    title = "On a class of functions attaining their maximum at the vertices of a polyhedron",\n    journal = "Discret. Appl. Math.",\n    volume = "22",\n    number = "2",\n    pages = "191--195",\n    year = "1989",\n    url = "https://doi.org/10.1016/0166-218X(88)90093-5",\n    doi = "10.1016/0166-218X(88)90093-5",\n    timestamp = "Thu, 11 Feb 2021 00:00:00 +0100",\n    biburl = "https://dblp.org/rec/journals/dam/Tardella89.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1987\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Sequential stopping rules for the multistart algorithm in global optimisation.\n \n \n \n \n\n\n \n Betrò, B.; and Schoen, F.\n\n\n \n\n\n\n Math. Program., 38(3): 271–286. 1987.\n \n\n\n\n
\n\n\n\n \n \n \"SequentialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/mp/BetroS87,\n    author = "Betr{\\`{o}}, Bruno and Schoen, Fabio",\n    title = "Sequential stopping rules for the multistart algorithm in global optimisation",\n    journal = "Math. Program.",\n    volume = "38",\n    number = "3",\n    pages = "271--286",\n    year = "1987",\n    url = "https://doi.org/10.1007/BF02592015",\n    doi = "10.1007/BF02592015",\n    timestamp = "Sat, 27 May 2017 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/mp/BetroS87.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1984\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A survey on the global optimization problem: General theory and computational approaches.\n \n \n \n \n\n\n \n Archetti, F.; and Schoen, F.\n\n\n \n\n\n\n Ann. Oper. Res., 1(2): 87–110. 1984.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/anor/ArchettiS84,\n    author = "Archetti, Francesco and Schoen, Fabio",\n    title = "A survey on the global optimization problem: General theory and computational approaches",\n    journal = "Ann. Oper. Res.",\n    volume = "1",\n    number = "2",\n    pages = "87--110",\n    year = "1984",\n    url = "https://doi.org/10.1007/BF01876141",\n    doi = "10.1007/BF01876141",\n    timestamp = "Thu, 13 Aug 2020 01:00:00 +0200",\n    biburl = "https://dblp.org/rec/journals/anor/ArchettiS84.bib",\n    bibsource = "dblp computer science bibliography, https://dblp.org"\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);