The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
In this paper we will describe a new class of coloring problems, arising from military frequency assignment, where we want to minimize the number of distinct -uples of colors used to color a given set of -complete-subgraphs of a graph. We will propose two relaxations based on Semi-Definite Programming models for graph and hypergraph coloring, to approximate those (generally) NP-hard problems, as well as a generalization of the works of Karger et al. for hypergraph coloring, to find good feasible...
In this paper we will describe a new class of coloring
problems, arising from military frequency assignment, where we want to
minimize the number of distinct n-uples of colors used to color a given
set of n-complete-subgraphs of a graph.
We will propose two relaxations based on
Semi-Definite Programming models for graph and hypergraph
coloring, to approximate those (generally) NP-hard problems, as well as
a generalization of the works of Karger et al. for hypergraph coloring,
to find good feasible...
We study a continuous version of the capacity and flow assignment problem (CFA) where the design cost is combined with an average delay measure to yield a non convex objective function coupled with multicommodity flow constraints. A separable convexification of each arc cost function is proposed to obtain approximate feasible solutions within easily computable gaps from optimality. On the other hand, DC (difference of convex functions) programming can be used to compute accurate upper bounds and...
We study a continuous version of the capacity and flow assignment problem
(CFA) where the design cost is combined with an average delay measure
to yield a non convex objective function coupled with multicommodity flow
constraints. A separable convexification of each arc cost function is proposed
to obtain approximate feasible solutions within easily computable gaps from
optimality. On the other hand, DC (difference of convex functions) programming can be used
to compute accurate upper bounds and...
The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorithms.
The simple plant location problem (SPLP) is considered and
a genetic algorithm is
proposed to solve this problem. By using the developed
algorithm it is possible to solve SPLP
with more than 1000 facility sites and customers.
Computational results are presented and
compared to dual based algorithms.
Currently displaying 1 –
7 of
7