The problem of finding structures with minimum stabbing number has received considerable attention from researchers. Particularly, [10] study the minimum stabbing number of perfect matchings (mspm), spanning trees (msst) and triangulations (mstr) associated to set of points in the plane. The complexity of the mstr remains open whilst the other two are known to be 𝓝𝓟-hard. This paper presents integer programming (ip) formulations for these three problems, that allowed us to...
Many well-known combinatorial optimization problems can be stated over the set of acyclic orientations of an undirected graph. For example, acyclic orientations with certain diameter constraints are closely related to the optimal solutions of the vertex coloring and frequency assignment problems. In this paper we introduce a linear programming formulation of acyclic orientations with path constraints, and discuss its use in the solution of the vertex coloring problem and some versions of the frequency...
Many well-known combinatorial optimization problems can be stated over the set of acyclic orientations
of an undirected graph. For example, acyclic orientations with certain diameter constraints are
closely related to the optimal solutions of the vertex coloring and frequency assignment problems.
In this paper we introduce a linear programming formulation of acyclic orientations
with path constraints, and discuss its use in the solution of the vertex coloring problem and
some versions of the frequency...
Download Results (CSV)