Sassano Antonio

Antonio Sassano

Information about the author Antonio Sassano will soon be added to the site.
Found 11 papers in total
GUB Covers and Power‐Indexed Formulations for Wireless Network Design
GUB Covers and Power‐Indexed Formulations for Wireless Network Design
2013
We propose a pure 0‐1 formulation for the wireless network design problem,...
Models and solution techniques for frequency assignment problems
Models and solution techniques for frequency assignment problems
2007
Wireless communication is used in many different situations such as mobile telephony,...
Metric inequalities and the Network Loading Problem
Metric inequalities and the Network Loading Problem
2007
Given a simple graph G(V,E) and a set of traffic demands between the nodes of G , the...
(0, ±1) ideal matrices
(0, ±1) ideal matrices
1998
A (0, 1) matrix A is said to be ideal if all the vertices of the polytope Q(A) = {x...
A Lagrangian-based heuristic for large-scale set covering problems
A Lagrangian-based heuristic for large-scale set covering problems
1998
We present a new Lagrangian-based heuristic for solving large-scale set-covering...
Solving hard set covering problems
Solving hard set covering problems
1995
The authors propose a new branch-and-bound algorithm to solve hard instances of set...
Stability number of bull- and chair-free graphs
Stability number of bull- and chair-free graphs
1993
A bull is the graph with vertices a,b,c,d,e and edges ab,ac,bc,ad,be; a chair is the...
The equipartition polytope. I: Formulations, dimension and basic facets
The equipartition polytope. I: Formulations, dimension and basic facets
1990
The following basic clustering problem arises in different domains, ranging from...
The equipartition polytope. II: Valid inequalities and facets
The equipartition polytope. II: Valid inequalities and facets
1990
The equipartition problem is defined as follows: given a graph G= ( V, e ) and edge...
On the 0,1 facets of the set covering polytope
On the 0,1 facets of the set covering polytope
1989
In this paper, the authors consider inequalities of the form Σ α j x j...
Scheduling tasks with sequence-dependent processing times
Scheduling tasks with sequence-dependent processing times
1988
In this article the authors consider the problem of minimizing the maximum completion...
Papers per page: