default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlessandro Zanarini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j6]Max Åstrand, Mikael Johansson, Alessandro Zanarini:
Underground mine scheduling of mobile machines using Constraint Programming and Large Neighborhood Search. Comput. Oper. Res. 123: 105036 (2020)- [j5]Ioannis Lymperopoulos
, Faran A. Qureshi, Altug Bitlislioglu, Jan Poland, Alessandro Zanarini, Mehmet Mercangöz, Colin N. Jones:
Ancillary Services Provision Utilizing a Network of Fast-Charging Stations for Electrical Buses. IEEE Trans. Smart Grid 11(1): 665-672 (2020)
2010 – 2019
- 2018
- [c18]Max Åstrand, Mikael Johansson, Alessandro Zanarini:
Fleet Scheduling in Underground Mines Using Constraint Programming. CPAIOR 2018: 605-613 - 2017
- [c17]Robin Verschueren, Hans Joachim Ferreau, Alessandro Zanarini, Mehmet Mercangöz, Moritz Diehl:
A stabilizing nonlinear model predictive control scheme for time-optimal point-to-point motions. CDC 2017: 2525-2530 - [c16]Alessandro Zanarini, Jan Poland:
A Hybrid Approach for Stator Winding Design Optimization. CPAIOR 2017: 131-146 - [c15]Alessandro Zanarini:
Optimal Stock Sizing in a Cutting Stock Problem with Stochastic Demands. CPAIOR 2017: 293-301 - 2016
- [c14]Alessio Bonfietti, Alessandro Zanarini, Michele Lombardi, Michela Milano:
The Multirate Resource Constraint. CP 2016: 113-129 - 2014
- [c13]Mahmoud Jafargholi, Helfried Peyrl, Alessandro Zanarini, Martin Herceg, Sébastien Mariéthoz:
Accelerating space traversal methods for explicit model predictive control via space partitioning trees. ECC 2014: 103-108 - [i1]Gilles Pesant, Claude-Guy Quimper, Alessandro Zanarini:
Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems. CoRR abs/1401.4601 (2014) - 2013
- [c12]Helfried Peyrl, Stefan Richter, Alessandro Zanarini:
Multi-core parallelisation of integer optimisation model predictive control for power electronic applications. ECC 2013: 1511-1516 - [c11]Alessandro Zanarini, Mahmoud Jafargholi, Helfried Peyrl:
Exploiting parallelization in explicit model predictive control. ICAT 2013: 1-7 - [c10]Marc-Alexandre Boechat, Junyi Liu, Helfried Peyrl, Alessandro Zanarini, Thomas Besselmann:
An architecture for solving quadratic programs with the fast gradient method on a Field Programmable Gate Array. MED 2013: 1557-1562 - 2012
- [j4]Gilles Pesant, Claude-Guy Quimper, Alessandro Zanarini:
Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems. J. Artif. Intell. Res. 43: 173-210 (2012) - 2011
- [j3]Michele Lombardi, Michela Milano, Andrea Roli, Alessandro Zanarini:
Deriving Information from Sampling and Diving. Fundam. Informaticae 107(2-3): 267-287 (2011) - [c9]Gilles Pesant, Alessandro Zanarini:
Recovering Indirect Solution Densities for Counting-Based Branching Heuristics. CPAIOR 2011: 170-175 - [c8]Alessandro Zanarini, Pascal Van Hentenryck:
Identifying Patterns in Sequences of Variables. CPAIOR 2011: 246-251 - 2010
- [j2]Alessandro Zanarini:
Global Constraint Propagation Based On Graph Theory. Intelligenza Artificiale 4(1): 5-17 (2010) - [c7]Pierre Schaus, Pascal Van Hentenryck, Alessandro Zanarini:
Revisiting the Soft Global Cardinality Constraint. CPAIOR 2010: 307-312 - [c6]Alessandro Zanarini, Gilles Pesant:
More Robust Counting-Based Search Heuristics with Alldifferent Constraints. CPAIOR 2010: 354-368
2000 – 2009
- 2009
- [j1]Alessandro Zanarini, Gilles Pesant:
Solution counting algorithms for constraint-centered search heuristics. Constraints An Int. J. 14(3): 392-413 (2009) - [c5]Michele Lombardi, Michela Milano, Andrea Roli, Alessandro Zanarini:
Deriving Information from Sampling and Diving. AI*IA 2009: 82-91 - [c4]Ronan LeBras, Alessandro Zanarini, Gilles Pesant:
Efficient Generic Search Heuristics within the EMBP Framework. CP 2009: 539-553 - 2007
- [c3]Alessandro Zanarini, Gilles Pesant:
Solution Counting Algorithms for Constraint-Centered Search Heuristics. CP 2007: 743-757 - [c2]Alessandro Zanarini, Gilles Pesant:
Generalizations of the Global Cardinality Constraint for Hierarchical Resources. CPAIOR 2007: 361-375 - 2006
- [c1]Alessandro Zanarini, Michela Milano, Gilles Pesant:
Improved Algorithm for the Soft Global Cardinality Constraint. CPAIOR 2006: 288-299
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-04-24 22:48 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:
