dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Pietro Belotti Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2011
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiacomo Nannicini, Pietro Belotti, Jon Lee, Jeff Linderoth, François Margot, Andreas Wächter: A Probing Algorithm for MINLP with Failure Prediction by SVM. CPAIOR 2011: 154-169
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNora Touati Moungla, Pietro Belotti, Vincent Jost, Leo Liberti: A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem. INOC 2011: 439-449
2010
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti: Feasibility-Based Bounds Tightening via Fixed Points. COCOA (1) 2010: 65-76
14no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti: On the Convergence of Feasibility based Bounds Tightening. CTW 2010: 21-24
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPietro Belotti, Andrew J. Miller, Mahdi Namazifar: Valid Inequalities and Convex Hulls for Multilinear Functions. Electronic Notes in Discrete Mathematics 36: 805-812 (2010)
2008
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPietro Belotti, Antonio Capone, Giuliana Carello, Federico Malucelli: Multi-layer MPLS network design: The impact of statistical multiplexing. Computer Networks 52(6): 1291-1307 (2008)
2007
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPietro 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)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSergei Kucherenko, Pietro Belotti, Leo Liberti, Nelson Maculan: New formulations for the Kissing Number Problem. Discrete Applied Mathematics 155(14): 1837-1841 (2007)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar: Provisioning virtual private networks under traffic uncertainty. Networks 49(1): 100-115 (2007)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPietro Belotti, Federico Malucelli, Lorenzo Brunetta: Multicommodity network design with discrete node costs. Networks 49(1): 90-99 (2007)
2006
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdoardo Amaldi, Pietro Belotti, Antonio Capone, Federico Malucelli: Optimizing base station location and configuration in UMTS networks. Annals OR 146(1): 135-151 (2006)
2005
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdoardo Amaldi, Pietro Belotti, Raphael Hauser: Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem. IPCO 2005: 249-264
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPietro Belotti: Multicommodity network design with survivability constraints: Some models and algorithms. 4OR 3(1): 79-81 (2005)
2004
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar: Virtual Private Network Design Under Traffic Uncertainty. CTW 2004: 24-27
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPietro Belotti, Federico Malucelli: Network Design with Grooming Constraints. CTW 2004: 51-55
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar: Virtual Private Network Design Under Traffic Uncertainty. Electronic Notes in Discrete Mathematics 17: 19-22 (2004)
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPietro Belotti, Federico Malucelli: Network design with grooming constraints. Electronic Notes in Discrete Mathematics 17: 51-56 (2004)

Coauthor Index

1Aysegül Altin [2] [4] [9]
2Edoardo Amaldi [2] [4] [6] [7] [9]
3Lorenzo Brunetta [8]
4Sonia Cafieri [14] [15]
5Antonio Capone [7] [12]
6Giuliana Carello [12]
7Raphael Hauser [6]
8Vincent Jost [16]
9Sergei Kucherenko [10]
10Martine Labbé [11]
11Jon Lee [14] [15] [17]
12Leo Liberti [10] [14] [15] [16]
13Jeff T. Linderoth (Jeffrey T. Linderoth, Jeff Linderoth) [17]
14Nelson Maculan [10]
15Francesco Maffioli [11]
16Federico Malucelli [1] [3] [7] [8] [12]
17François Margot [17]
18Andrew J. Miller [13]
19Nora Touati Moungla [16]
20Mahdi Namazifar [13]
21Giacomo Nannicini [17]
22Malick M. Ndiaye [11]
23Mustafa Ç. Pinar (Mustafa Pinar) [2] [4] [9]
24Andreas Wächter [17]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page