default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefano Gualandi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Lorenzo Bonasera
, Stefano Gualandi:
Optimal shapelets tree for time series interpretable classification. EURO J. Comput. Optim. 12: 100091 (2024)- [c21]Lorenzo Bonasera, Davide Duma, Stefano Gualandi:
Learning Sparse-Lets for Interpretable Classification of Event-interval Sequences. MIC (2) 2024: 3-18 - [i7]Ambrogio Maria Bernardelli, Eleonora Vercesi, Stefano Gualandi, Monaldo Mastrolilli, Luca Maria Gambardella:
On the integrality gap of the Complete Metric Steiner Tree Problem via a novel formulation. CoRR abs/2405.13773 (2024) - 2023
- [j23]Eleonora Vercesi, Stefano Gualandi, Monaldo Mastrolilli, Luca Maria Gambardella:
On the generation of metric TSP instances with a large integrality gap by branch-and-cut. Math. Program. Comput. 15(2): 389-416 (2023) - [c20]Ambrogio Maria Bernardelli, Stefano Gualandi, Hoong Chuin Lau, Simone Milanesi:
The BeMi Stardust: A Structured Ensemble of Binarized Neural Networks. LION 2023: 443-458 - 2022
- [j22]Luca Ferrarini, Stefano Gualandi:
Total Coloring and Total Matching: Polyhedra and Facets. Eur. J. Oper. Res. 303(1): 129-142 (2022) - [j21]Stefano Coniglio, Stefano Gualandi:
Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming. INFORMS J. Comput. 34(2): 1006-1023 (2022) - [c19]Gennaro Auricchio, Luca Ferrarini, Stefano Gualandi, Greta Lanzarotto, Ludovico Pernazza:
A SAT Encoding to Compute Aperiodic Tiling Rhythmic Canons. CPAIOR 2022: 14-23 - [i6]Stefano Gualandi, Giuseppe Toscani, Eleonora Vercesi:
A kinetic description of the body size distributions of species. CoRR abs/2206.00495 (2022) - [i5]Ambrogio Maria Bernardelli, Stefano Gualandi, Hoong Chuin Lau, Simone Milanesi:
The BeMi Stardust: a Structured Ensemble of Binarized Neural Networks. CoRR abs/2212.03659 (2022) - 2021
- [i4]Riccardo Bellazzi, Andrea Codegoni, Stefano Gualandi, Giovanna Nicora, Eleonora Vercesi:
The Gene Mover's Distance: Single-cell similarity via Optimal Transport. CoRR abs/2102.01218 (2021) - [i3]Gennaro Auricchio, Andrea Codegoni, Stefano Gualandi, Lorenzo Zambon:
The Fourier Loss Function. CoRR abs/2102.02979 (2021) - [i2]Luca Ferrarini, Stefano Gualandi:
Total Coloring and Total Matching: Polyhedra and Facets. CoRR abs/2105.09827 (2021) - 2020
- [j20]Federico Bassetti, Stefano Gualandi, Marco Veneroni:
On the Computation of Kantorovich-Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows. SIAM J. Optim. 30(3): 2441-2469 (2020) - [c18]Pierre-Yves Bouchet, Stefano Gualandi, Louis-Martin Rousseau:
Primal Heuristics for Wasserstein Barycenters. CPAIOR 2020: 239-255
2010 – 2019
- 2019
- [j19]Marco Chiarandini, Rolf Fagerberg, Stefano Gualandi:
Handling preferences in student-project allocation. Ann. Oper. Res. 275(1): 39-78 (2019) - [c17]Gennaro Auricchio, Federico Bassetti, Stefano Gualandi, Marco Veneroni:
Computing Wasserstein Barycenters via Linear Programming. CPAIOR 2019: 355-363 - 2018
- [c16]Gennaro Auricchio, Federico Bassetti, Stefano Gualandi, Marco Veneroni:
Computing Kantorovich-Wasserstein Distances on d-dimensional histograms using (d+1)-partite graphs. NeurIPS 2018: 5798-5808 - [p2]Maurizio Fiasché, Diego E. Liberati, Stefano Gualandi, Marco Taisch:
Quantum-Inspired Evolutionary Multiobjective Optimization for a Dynamic Production Scheduling Approach. Multidisciplinary Approaches to Neural Computing 2018: 191-201 - 2017
- [c15]Stefano Coniglio, Stefano Gualandi:
On the Separation of Topology-Free Rank Inequalities for the Max Stable Set Problem. SEA 2017: 29:1-29:13 - 2016
- [j18]Michele Lombardi, Stefano Gualandi:
A lagrangian propagator for artificial neural networks in constraint programming. Constraints An Int. J. 21(4): 435-462 (2016) - [j17]Borzou Rostami, Federico Malucelli, Pietro Belotti, Stefano Gualandi:
Lower bounding procedure for the asymmetric quadratic traveling salesman problem. Eur. J. Oper. Res. 253(3): 584-592 (2016) - 2014
- [j16]Giulia Galbiati, Stefano Gualandi, Francesco Maffioli:
On Minimum Reload Cost Cycle Cover. Discret. Appl. Math. 164: 112-120 (2014) - [j15]Edoardo Amaldi, Stefano Coniglio, Stefano Gualandi:
Coordinated cutting plane generation via multi-objective separation. Math. Program. 143(1-2): 87-110 (2014) - 2013
- [j14]Stefano Gualandi, Federico Malucelli:
Constraint Programming-based Column Generation. Ann. Oper. Res. 204(1): 11-32 (2013) - [j13]Stefano Gualandi, Francesco Maffioli, Claudio Magni:
A branch-and-price approach to k-clustering minimum biclique completion problem. Int. Trans. Oper. Res. 20(1): 101-117 (2013) - [c14]Stefano Gualandi, Michele Lombardi:
A Simple and Effective Decomposition for the Multidimensional Binpacking Constraint. CP 2013: 356-364 - [c13]Michele Lombardi, Stefano Gualandi:
A New Propagator for Two-Layer Neural Networks in Empirical Model Learning. CP 2013: 448-463 - [c12]Borzou Rostami, Federico Malucelli, Pietro Belotti, Stefano Gualandi:
Quadratic TSP: A lower bounding procedure and a column generation approach. FedCSIS 2013: 377-384 - [p1]Antonio Capone, Ilario Filippini, Stefano Gualandi, Di Yuan:
Resource Optimization in Multiradio Multichannel Wireless Mesh Networks. Mobile Ad Hoc Networking 2013: 239-274 - [i1]Giulia Galbiati, Stefano Gualandi:
Coloring of paths into forests. CTW 2013: 113-116 - 2012
- [j12]Stefano Gualandi, Federico Malucelli:
A simple branching scheme for vertex coloring problems. Discret. Appl. Math. 160(1-2): 192-196 (2012) - [j11]Marco Chiarandini, Luca Di Gaspero, Stefano Gualandi, Andrea Schaerf:
The balanced academic curriculum problem revisited. J. Heuristics 18(1): 119-148 (2012) - [j10]Stefano Gualandi, Federico Malucelli:
Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation. INFORMS J. Comput. 24(1): 81-100 (2012) - [c11]Stefano Gualandi, Federico Malucelli:
Resource Constrained Shortest Paths with a Super Additive Objective Function. CP 2012: 299-315 - 2011
- [j9]Antonio Capone, Stefano Gualandi, Di Yuan:
Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding. Ad Hoc Networks 9(7): 1256-1269 (2011) - [j8]Antonio Capone, Lei Chen, Stefano Gualandi, Di Yuan:
A New Computational Approach for Maximum Link Activation in Wireless Networks under the SINR Model. IEEE Trans. Wirel. Commun. 10(5): 1368-1372 (2011) - [c10]Paolo Cremonesi, Andrea Sansottera, Stefano Gualandi:
On the Cooling-Aware Workload Placement Problem. AI for Data Center Management and Cloud Computing 2011 - [c9]Paolo Cremonesi, Andrea Sansottera, Stefano Gualandi:
Optimizing cooling and server power consumption. ICCP 2011: 455-462 - [c8]Giulia Galbiati, Stefano Gualandi, Francesco Maffioli:
On Minimum Changeover Cost Arborescences. SEA 2011: 112-123 - 2010
- [j7]Antonio Capone, Giuliana Carello, Ilario Filippini, Stefano Gualandi, Federico Malucelli:
Routing, scheduling and channel assignment in Wireless Mesh Networks: Optimization models and algorithms. Ad Hoc Networks 8(6): 545-563 (2010) - [j6]Giulia Galbiati, Stefano Gualandi, Francesco Maffioli:
On Minimum Reload Cost Cycle Cover. Electron. Notes Discret. Math. 36: 81-88 (2010) - [j5]Antonio Capone, Giuliana Carello, Ilario Filippini, Stefano Gualandi, Federico Malucelli:
Solving a resource allocation problem in wireless mesh networks: A comparison between a CP-based and a classical column generation. Networks 55(3): 221-233 (2010) - [j4]Giulia Galbiati, Stefano Gualandi, Francesco Maffioli:
Computational experience with a SDP-based algorithm for maximum cut with limited unbalance. Networks 55(3): 247-255 (2010) - [j3]Francesco Amigoni, Stefano Gualandi, Daniele Menotti, Guido Sangiovanni:
A multiagent architecture for controlling the Palamede satellite. Web Intell. Agent Syst. 8(3): 269-289 (2010) - [c7]Stefano Gualandi, Federico Malucelli, Domenico L. Sozzi:
On the Design of the Fiber To The Home Networks. CTW 2010: 65-68 - [c6]Stefano Gualandi, Francesco Maffioli, Claudio Magni:
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem. CTW 2010: 69-72 - [c5]Kanika Dhyani, Stefano Gualandi, Paolo Cremonesi:
A Constraint Programming Approach for the Service Consolidation Problem. CPAIOR 2010: 97-101 - [c4]Stefano Gualandi, Federico Malucelli, Domenico L. Sozzi:
On the Design of the Next Generation Access Networks. CPAIOR 2010: 162-175 - [c3]Edoardo Amaldi, Stefano Coniglio, Stefano Gualandi:
Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation. SEA 2010: 266-275
2000 – 2009
- 2009
- [j2]Stefano Gualandi, Federico Malucelli:
Constraint programming-based column generation. 4OR 7(2): 113-137 (2009) - [j1]Stefano Gualandi:
Enhancing CP-based column generation for integer programs. 4OR 7(3): 289-292 (2009) - [c2]Stefano Gualandi:
k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach. CPAIOR 2009: 87-101 - 2008
- [c1]Stefano Gualandi, Federico Malucelli:
Exact Graph Coloring via Hybrid Approaches. CTW 2008: 32-34
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 00:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
