Follow
Paolo Nobili
Paolo Nobili
Professor of Operations Research, Universitą della Tuscia
Verified email at unitus.it
Title
Cited by
Cited by
Year
A Lagrangian-based heuristic for large-scale set covering problems
S Ceria, P Nobili, A Sassano
Mathematical Programming 81 (2), 215-228, 1998
2481998
On the satisfiability of dependency constraints in entity-relationship schemata
M Lenzerini, P Nobili
Information Systems 15 (4), 453-461, 1990
1751990
Facets and lifting procedures for the set covering polytope
P Nobili, A Sassano
Mathematical Programming 45 (1), 111-137, 1989
631989
The relation of time indexed formulations of single machine scheduling problems to the node packing problem
H Waterer, EL Johnson, P Nobili, MWP Savelsbergh
Mathematical Programming 93 (3), 477-494, 2002
302002
Minimum power multicasting problem in wireless networks
V Leggieri, P Nobili, C Triki
Mathematical Methods of Operations Research 68 (2), 295-311, 2008
292008
A separation routine for the set covering polytope
P Nobili, A Sassano
Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed …, 1992
281992
An algorithm for the weighted stable set problem in claw-free graphs
P Nobili, A Sassano
arXiv preprint arXiv:1501.05775, 2015
26*2015
Energy consumption minimization in railway planning
T Montrone, P Pellegrini, P Nobili, G Longo
2016 IEEE 16th International Conference on Environment and Electrical …, 2016
202016
Set Covering Problem. Annotated bibliographies in combinatorial optimization. M
S Ceria, P Nobili, A Sassano, M Dell’Amico, F Maffioli, S Martello
Wiley, 1997
201997
Real-time energy consumption minimization in railway networks
T Montrone, P Pellegrini, P Nobili
Transportation Research Part D: Transport and Environment 65, 524-539, 2018
152018
(0,±1) ideal matrices
P Nobili, A Sassano
Mathematical programming 80 (3), 265-281, 1998
151998
A reduction algorithm for the weighted stable set problem in claw-free graphs
P Nobili, A Sassano
Discrete Applied Mathematics 165, 245-262, 2014
112014
Improved approximation of maximum vertex cover
A Galluccio, P Nobili
Operations Research Letters 34 (1), 77-84, 2006
112006
Polyhedral properties of clutter amalgam
P Nobili, A Sassano
SIAM Journal on Discrete Mathematics 6 (1), 139-151, 1993
111993
Energy consumption minimization problem in a railway network
T Montrone, P Pellegrini, P Nobili
Transportation Research Procedia 22, 85-94, 2017
102017
Optimal routing and resource allocation in multi-hop wireless networks
E Castorini, P Nobili, C Triki
Optimization Methods & Software 23 (4), 593-608, 2008
72008
Polynomial time recognition of essential graphs having stability number equal to matching number
R Mosca, P Nobili
Graphs and Combinatorics 31 (5), 1649-1658, 2015
52015
Strengthening lagrangian bounds for the MAX-SAT problem
P Nobili, A Sassano
Consiglio Nazionale delle Ricerche. Istituto di Analisi dei Sistemi ed …, 1996
51996
A set covering formulation of the matrix equipartition problem
S Nicoloso, P Nobili
System Modelling and Optimization, 189-198, 1992
51992
A MILP Algorithm for the Minimization of Train Delay and Energy Consumption
T Montrone, P Pellegrini, P Nobili
International Conference on Optimization and Decision Science, 485-493, 2017
42017
The system can't perform the operation now. Try again later.
Articles 1–20