Zobrazeno 1 - 10
of 149
pro vyhledávání: '"Matteo Fischetti"'
Publikováno v:
Mathematical Programming Computation. 14:749-779
In this paper, an effective heuristic algorithm for large-scale instances of the Capacitated Vehicle Routing Problem is proposed. The technique consists in a local search method entangled with a restricted Set Partitioning problem optimization. Helsg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c5aa3435fe49a73e44e23b9157bb767b
https://doi.org/10.1007/s12532-022-00224-2
https://doi.org/10.1007/s12532-022-00224-2
Autor:
Matteo Fischetti, Michele Monaci
Publikováno v:
European Journal of Operational Research. 282:506-514
In this paper, we consider the Mixed-Integer Bilinear Programming problem, a widely-used reformulation of the classical mixed-integer quadratic programming problem. For this problem we describe a branch-and-cut algorithm for its exact solution, based
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::03269424caa224713a2d208b5650e70d
https://doi.org/10.1016/j.ejor.2019.09.043
https://doi.org/10.1016/j.ejor.2019.09.043
Finding high-quality solutions to mixed-integer linear programming problems (MILPs) is of great importance for many practical applications. In this respect, the refinement heuristic local branching (LB) has been proposed to produce improving solution
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::19a412b28dfb436b109be0d003be15da
http://hdl.handle.net/11577/3452518
http://hdl.handle.net/11577/3452518
Autor:
Martina Fischetti, Matteo Fischetti
We address a very important problem in offshore wind farm design, namely, the combined optimization of the turbine location and of the connection cables required to bring the electrical power produced by the turbines to a given substation, and eventu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::39f04395d0fda23a96f2af141c176b06
http://hdl.handle.net/11577/3453697
http://hdl.handle.net/11577/3453697
Publikováno v:
European Journal of Operational Research
Fischetti, M, Fischetti, M & Stoustrup, J 2023, ' Safe distancing in the time of COVID-19 ', European Journal of Operational Research, vol. 304, no. 1, pp. 139-149 . https://doi.org/10.1016/j.ejor.2021.07.010
Fischetti, M, Fischetti, M & Stoustrup, J 2023, ' Safe distancing in the time of COVID-19 ', European Journal of Operational Research, vol. 304, no. 1, pp. 139-149 . https://doi.org/10.1016/j.ejor.2021.07.010
The spread of viruses such as SARS-CoV-2 brought new challenges to our society, including a stronger focus on safety across all businesses. Many countries have imposed a minimum social distance among people in order to ensure their safety. This bring
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9531809927073a25c8ed3b2f956aaf13
http://europepmc.org/articles/PMC8272071
http://europepmc.org/articles/PMC8272071
Publikováno v:
INFORMS Journal on Computing. 31:390-410
Two-person interdiction games represent an important modeling concept for applications in marketing, defending critical infrastructure, stopping nuclear weapons projects, or preventing drug smuggling. We present an exact branch-and-cut algorithm for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a06ce512e1ccff04cf33e9b345531316
https://doi.org/10.1287/ijoc.2018.0831
https://doi.org/10.1287/ijoc.2018.0831
Autor:
Matteo Fischetti, Matteo Stringher
Publikováno v:
Communications in Computer and Information Science ISBN: 9783030856717
OLA
OLA
We propose a new metaheuristic training scheme for Machine Learning that combines Stochastic Gradient Descent (SGD) and Discrete Optimization in an unconventional way. Our idea is to define a discrete neighborhood of the current SGD point containing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f26365d4a7059f92698066abfb60dfa9
https://doi.org/10.1007/978-3-030-85672-4_1
https://doi.org/10.1007/978-3-030-85672-4_1
Publikováno v:
Fischetti, M, Kahr, M, Leitner, M, Monaci, M & Ruthmair, M 2018, ' Least cost influence propagation in (social) networks ', Mathematical Programming, vol. 170, no. 1, pp. 293-325 . https://doi.org/10.1007/s10107-018-1288-y
Mathematical Programming, 170(1), 293-325. Springer-Verlag GmbH and Co. KG
Mathematical Programming, 170(1), 293-325. Springer-Verlag GmbH and Co. KG
Influence maximization problems aim to identify key players in (social) networks and are typically motivated from viral marketing. In this work, we introduce and study the Generalized Least Cost Influence Problem (GLCIP) that generalizes many previou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf567aec57cd2c1e9eb8126dd567824e
https://doi.org/10.1007/s10107-018-1288-y
https://doi.org/10.1007/s10107-018-1288-y
Publikováno v:
Management Science. 63:2146-2162
The uncapacitated facility location (UFL) problem is one of the most famous and most studied problems in the operations research literature. Given a set of potential facility locations and a set of customers, the goal is to find a subset of facility
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::73f05c4c91c36c03cc4d9f653de44d10
https://doi.org/10.1287/mnsc.2016.2461
https://doi.org/10.1287/mnsc.2016.2461
Autor:
Michele Monaci, Matteo Fischetti
Publikováno v:
Journal of Heuristics. 20:709-731
In this paper we investigate the effects of replacing the objective function of a 0-1 mixed-integer convex program (MIP) with a "proximity" one, with the aim of using a black-box solver as a refinement heuristic. Our starting observation is that enum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3966a6050611e5de62e76742dd792d6c
https://doi.org/10.1007/s10732-014-9266-x
https://doi.org/10.1007/s10732-014-9266-x