default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSara Mattia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Sara Mattia
:
Reformulations and complexity of the clique interdiction problem by graph mapping. Discret. Appl. Math. 354: 48-57 (2024)- 2023
- [j22]Tiziano Bacci, Sara Mattia, Paolo Ventura:
The realization-independent reallocation heuristic for the stochastic container relocation problem. Soft Comput. 27(7): 4223-4233 (2023) - [j21]Sara Mattia:
The follower optimality cuts for mixed integer linear bilevel programming problems. Soft Comput. 27(16): 11529-11550 (2023) - 2022
- [i1]Tiziano Bacci, Sara Mattia, Paolo Ventura:
The Bounded Beam Search algorithm for the Block Relocation Problem. CoRR abs/2206.12303 (2022) - 2021
- [j20]Pasquale Avella, Maurizio Boccia, Sara Mattia, Fabrizio Rossi:
Weak flow cover inequalities for the capacitated facility location problem. Eur. J. Oper. Res. 289(2): 485-494 (2021) - 2020
- [j19]Tiziano Bacci, Sara Mattia, Paolo Ventura:
A branch-and-cut algorithm for the restricted Block Relocation Problem. Eur. J. Oper. Res. 287(2): 452-459 (2020)
2010 – 2019
- 2019
- [j18]Tiziano Bacci, Sara Mattia, Paolo Ventura:
The bounded beam search algorithm for the block relocation problem. Comput. Oper. Res. 103: 252-264 (2019) - [j17]Pasquale Avella, Giacomo Bernardi, Maurizio Boccia, Sara Mattia:
An optimization approach for congestion control in network routing with quality of service requirements. Networks 74(2): 124-133 (2019) - [j16]Sara Mattia:
A polyhedral analysis of the capacitated edge activation problem with uncertain demands. Networks 74(2): 190-204 (2019) - [j15]Sara Mattia:
MIP-based heuristic approaches for the capacitated edge activation problem: the effect of non-compactness. Soft Comput. 23(9): 2911-2921 (2019) - 2018
- [j14]Sara Mattia, Michael Poss:
A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation. Comput. Optim. Appl. 69(3): 753-800 (2018) - [j13]Sara Mattia:
The capacity formulation of the capacitated edge activation problem. Networks 71(4): 381-402 (2018) - [c5]Tiziano Bacci, Sara Mattia, Paolo Ventura:
A New Lower Bound for the Block Relocation Problem. ICCL 2018: 168-174 - 2017
- [j12]Bernardetta Addis, Giuliana Carello, Sara Mattia:
Survivable green traffic engineering with shared protection. Networks 69(1): 6-22 (2017) - 2016
- [j11]Bernardetta Addis, Giuliana Carello, Sara Mattia:
Energy-aware survivable networks. Electron. Notes Discret. Math. 52: 133-140 (2016) - [c4]Sara Mattia:
Benders Decomposition for Capacitated Network Design. ISCO 2016: 71-80 - 2015
- [j10]Sara Mattia:
The cut property under demand uncertainty. Networks 66(2): 159-168 (2015) - 2014
- [c3]Sara Mattia, Fabrizio Rossi, Mara Servilio, Stefano Smriglio:
Robust Shift Scheduling in Call Centers. ISCO 2014: 336-346 - 2013
- [j9]Sara Mattia:
The robust network loading problem with dynamic routing. Comput. Optim. Appl. 54(3): 619-643 (2013) - [j8]Sara Mattia:
The cut condition for robust network design. Electron. Notes Discret. Math. 41: 303-310 (2013) - [j7]Sara Mattia:
A polyhedral study of the capacity formulation of the multilayer network design problem. Networks 62(1): 17-26 (2013) - 2012
- [j6]Sara Mattia:
Solving survivable two-layer network design problems by metric inequalities. Comput. Optim. Appl. 51(2): 809-834 (2012) - [j5]Sara Mattia:
Separating tight metric inequalities by bilevel programming. Oper. Res. Lett. 40(6): 568-572 (2012) - 2011
- [j4]Carlo Mannino, Sara Mattia, Antonio Sassano:
Planning wireless networks by shortest path. Comput. Optim. Appl. 48(3): 533-551 (2011) - [j3]Flavia Bonomo, Sara Mattia, Gianpaolo Oriolo:
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem. Theor. Comput. Sci. 412(45): 6261-6268 (2011) - [c2]Sara Mattia:
The Two Layer Network Design Problem. INOC 2011: 145-149
2000 – 2009
- 2007
- [j2]Pasquale Avella, Sara Mattia, Antonio Sassano:
Metric inequalities and the Network Loading Problem. Discret. Optim. 4(1): 103-114 (2007) - [j1]Daniel Bienstock, Sara Mattia:
Using mixed-integer programming to solve power grid blackout problems. Discret. Optim. 4(1): 115-141 (2007) - 2004
- [c1]Pasquale Avella, Sara Mattia, Antonio Sassano:
Metric Inequalities and the Network Loading Problem. IPCO 2004: 16-32
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-08-23 19:29 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:
