Sfoglia per Autore
A function space approach to the foundations of system theory
1983 P., D'Alessandro; G., Rinaldi; Sassano, Antonio
AN O(MN) ALGORITHM FOR REGULAR SET-COVERING PROBLEMS
1987 Paola, Bertolazzi; Sassano, Antonio
A Class of Polynomially Solvable Set-Covering Problems
1988 P., Bertolazzi; Sassano, Antonio
Scheduling tasks with sequence-dependent processing times
1988 L., Bianco; S., Ricciardelli; G., Rinaldi; Sassano, Antonio
The Steiner tree problem and homogeneous sets
1988 A., D'Atri; Moscarini, Marina; Sassano, Antonio
A decomposition strategy for the vertex cover problem
1989 P., Bertolazzi; Sassano, Antonio
Facets and lifting procedures for the set covering polytope
1989 P., Nobili; Sassano, Antonio
The complexity of matching with bonds
1989 M., Padberg; Sassano, Antonio
On the Facial Structure of the Set Covering Problem
1989 Sassano, Antonio
On the 0,1 facets of the set-covering problem
1989 Cornuejols, G; Sassano, Antonio
The equipartition polytope. I: Formulations, dimension and basic facets
1991 M., Conforti; M. R., Rao; Sassano, Antonio
The equipartition polytope. II: Valid inequalities and facets
1991 M., Conforti; M. R., Rao; Sassano, Antonio
A separation routine for the set covering polytope
1992 P., Nobili; Sassano, Antonio
A characterization of knapsacks with the max-flow---min-cut property
1992 M., Laurent; Sassano, Antonio
Polyhedral Properties of Clutter Amalgam
1993 Nobili, P. .; Sassano, Antonio
The anti-join composition and polyhedra
1993 P., Nobili; Sassano, Antonio
Stability Number of Bull- and Chair-Free Graphs
1993 C. D., Simone; Sassano, Antonio
An exact algorithm for the maximum stable set problem
1994 Mannino, Carlo; Sassano, Antonio
Solving Hard Set Covering Problems
1995 Mannino, Carlo; Sassano, Antonio
Preface
1995 Lucertini, M.; Rinaldi, G.; Sassano, A.; Simeone, B.
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile