default search action
Pietro Belotti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j24]Pietro Belotti
:
Spatial branching for a special class of convex MIQO problems. Optim. Lett. 18(8): 1757-1770 (2024) - [c11]Luca Pirolo
Optimal Charging Station Location in a Linear Cycle Path with Deviations. ISCO 2024: 361-375
2010 – 2019
- 2019
- [j23]Fabio Furini
QPLIB: a library of quadratic programming instances. Math. Program. Comput. 11(2): 237-265 (2019) - 2018
- [j22]Nathan Adelgren
Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming. INFORMS J. Comput. 30(2): 324-338 (2018) - 2017
- [j21]Pietro Belotti
A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization. Discret. Optim. 24: 3-31 (2017) - [j20]Pietro Belotti
Three ideas for a feasibility pump for nonconvex MINLP. Optim. Lett. 11(1): 3-15 (2017) - 2016
- [j19]Pietro Belotti
On handling indicator constraints in mixed integer programming. Comput. Optim. Appl. 65(3): 545-566 (2016) - [j18]Pietro Belotti
Fathoming rules for biobjective mixed integer linear programs: Review and extensions. Discret. Optim. 22: 341-363 (2016) - [j17]Borzou Rostami
Lower bounding procedure for the asymmetric quadratic traveling salesman problem. Eur. J. Oper. Res. 253(3): 584-592 (2016) - [j16]Warren Adams, Pietro Belotti
Convex hull characterizations of lexicographic orderings. J. Glob. Optim. 66(2): 311-329 (2016) - [c10]Pietro Belotti
Algorithms for discrete nonlinear optimization in FICO Xpress. SAM 2016: 1-5 - 2014
- [i2]Nathan Adelgren, Pietro Belotti, Akshay Gupte:
Efficient storage of Pareto points in biobjective mixed integer programming. CoRR abs/1411.6538 (2014) - 2013
- [j15]Pietro Belotti
Mixed-integer nonlinear optimization. Acta Numer. 22: 1-131 (2013) - [j14]Pietro Belotti
On families of quadratic surfaces having fixed intersections with two hyperplanes. Discret. Appl. Math. 161(16-17): 2778-2793 (2013) - [j13]Pietro Belotti
Bound reduction using pairs of linear inequalities. J. Glob. Optim. 56(3): 787-819 (2013) - [c9]Borzou Rostami, Federico Malucelli, Pietro Belotti, Stefano Gualandi:
Quadratic TSP: A lower bounding procedure and a column generation approach. FedCSIS 2013: 377-384 - 2012
- [j12]Giacomo Nannicini, Pietro Belotti
Rounding-based heuristics for nonconvex MINLPs. Math. Program. Comput. 4(1): 1-31 (2012) - [i1]Andrea Qualizza, Pietro Belotti, François Margot:
Linear Programming Relaxations of Quadratically Constrained Quadratic Programs. CoRR abs/1206.1633 (2012) - 2011
- [c8]Giacomo Nannicini, Pietro Belotti
A Probing Algorithm for MINLP with Failure Prediction by SVM. CPAIOR 2011: 154-169 - [c7]Nora Touati Moungla, Pietro Belotti
A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem. INOC 2011: 439-449 - 2010
- [j11]Pietro Belotti
Valid Inequalities and Convex Hulls for Multilinear Functions. Electron. Notes Discret. Math. 36: 805-812 (2010) - [c6]Pietro Belotti
Feasibility-Based Bounds Tightening via Fixed Points. COCOA (1) 2010: 65-76 - [c5]Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti:
On the Convergence of Feasibility based Bounds Tightening. CTW 2010: 21-24 - [p1]Sebastian Orlowski, Christian Raack, Arie M. C. A. Koster, Georg Baier, Thomas Engel, Pietro Belotti:
Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems. Graphs and Algorithms in Communication Networks 2010: 95-118
2000 – 2009
- 2009
- [j10]Pietro Belotti
Branching and bounds tighteningtechniques for non-convex MINLP. Optim. Methods Softw. 24(4-5): 597-634 (2009) - 2008
- [j9]Pietro Belotti
Multi-layer MPLS network design: The impact of statistical multiplexing. Comput. Networks 52(6): 1291-1307 (2008) - 2007
- [j8]Pietro Belotti, Martine Labbé, Francesco Maffioli, Malick M. Ndiaye:
A branch-and-cut method for the obnoxious p -median problem. 4OR 5(4): 299-314 (2007) - [j7]Sergei S. Kucherenko
New formulations for the Kissing Number Problem. Discret. Appl. Math. 155(14): 1837-1841 (2007) - [j6]Pietro Belotti
Multicommodity network design with discrete node costs. Networks 49(1): 90-99 (2007) - [j5]Aysegül Altin
Provisioning virtual private networks under traffic uncertainty. Networks 49(1): 100-115 (2007) - 2006
- [j4]Edoardo Amaldi, Pietro Belotti
Optimizing base station location and configuration in UMTS networks. Ann. Oper. Res. 146(1): 135-151 (2006) - 2005
- [j3]Pietro Belotti
Multicommodity network design with survivability constraints: Some models and algorithms. 4OR 3(1): 79-81 (2005) - [c4]Edoardo Amaldi, Pietro Belotti
Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem. IPCO 2005: 249-264 - 2004
- [j2]Aysegül Altin
Virtual Private Network Design Under Traffic Uncertainty. Electron. Notes Discret. Math. 17: 19-22 (2004) - [j1]Pietro Belotti
Network design with grooming constraints. Electron. Notes Discret. Math. 17: 51-56 (2004) - [c3]Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar:
Virtual Private Network Design Under Traffic Uncertainty. CTW 2004: 24-27 - [c2]Pietro Belotti, Federico Malucelli:
Network Design with Grooming Constraints. CTW 2004: 51-55 - 2001
- [c1]Pietro Belotti, Thomas Stidsen:
Optimal Placement of Wavelength Converting Nodes. DRCN 2001: 15-21
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-11-07 21:30 CET 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: