Results 1  10
of
960
Conflict Graphs in Integer Programming
 EUROPEAN JOURNAL OF OPERATIONS RESEARCH
, 1998
"... We report on the use of conflict graphs in solving integer programs. A conflict graph represents logical relations between binary variables appearing in an integer program. We develop algorithms and data structures that allow the effective and efficient construction, management, and use of dynamical ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We report on the use of conflict graphs in solving integer programs. A conflict graph represents logical relations between binary variables appearing in an integer program. We develop algorithms and data structures that allow the effective and efficient construction, management, and use
The Knapsack Problem with Conflict Graphs
, 2009
"... We extend the classical 01 knapsack problem by introducing disjunctive constraints for pairs of items which are not allowed to be packed together into the knapsack. These constraints are represented by edges of a conflict graph whose vertices correspond to the items of the knapsack problem. Similar ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We extend the classical 01 knapsack problem by introducing disjunctive constraints for pairs of items which are not allowed to be packed together into the knapsack. These constraints are represented by edges of a conflict graph whose vertices correspond to the items of the knapsack problem
Minimal Spanning Trees with Conflict Graphs
, 2009
"... For the classical minimum spanning tree problem we introduce disjunctive constraints for pairs of edges which can not be both included in the spanning tree at the same time. These constraints are represented by a conflict graph whose vertices correspond to the edges of the original graph. Edges in t ..."
Abstract
 Add to MetaCart
For the classical minimum spanning tree problem we introduce disjunctive constraints for pairs of edges which can not be both included in the spanning tree at the same time. These constraints are represented by a conflict graph whose vertices correspond to the edges of the original graph. Edges
Resource Allocation on Dynamic Conflict Graphs
"... The sharing of resources among processes in a distributed system leads to a conflict graph that may change with time. Resource allocation over a static conflict graph (also called the dining philosophers problem) has been studied extensively. We seek to solve resource allocation on dynamic conflict ..."
Abstract
 Add to MetaCart
The sharing of resources among processes in a distributed system leads to a conflict graph that may change with time. Resource allocation over a static conflict graph (also called the dining philosophers problem) has been studied extensively. We seek to solve resource allocation on dynamic conflict
Clustering Within Timetabling Conflict Graphs
"... A key concept in timetabling problems is that of the conflict graph with edges representing pairs of events that are not allowed to occur at the same time. Usually, the only information presented about such graphs is their density. However, intuitively, it seems likely that such graphs are structure ..."
Abstract
 Add to MetaCart
A key concept in timetabling problems is that of the conflict graph with edges representing pairs of events that are not allowed to occur at the same time. Usually, the only information presented about such graphs is their density. However, intuitively, it seems likely that such graphs
Conflict graphs in solving integer programming problems
, 1998
"... We report on the use of conflict graphs in solving integer programs. A conflict graph represents logical relations between binary variables. We develop algorithms and data structures that allow the effective and efficient construction, management, and use of dynamically changing condlict graphs. Our ..."
Abstract

Cited by 28 (1 self)
 Add to MetaCart
We report on the use of conflict graphs in solving integer programs. A conflict graph represents logical relations between binary variables. We develop algorithms and data structures that allow the effective and efficient construction, management, and use of dynamically changing condlict graphs
Practical Conflict Graphs for Dynamic Spectrum Distribution
"... Most spectrum distribution proposals today develop their allocation algorithms that use conflict graphs to capture interference relationships. The use of conflict graphs, however, is often questioned by the wireless community because of two issues. First, building conflict graphs requires significan ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
Most spectrum distribution proposals today develop their allocation algorithms that use conflict graphs to capture interference relationships. The use of conflict graphs, however, is often questioned by the wireless community because of two issues. First, building conflict graphs requires
The Conflict Graph for Maintaining CaseBased Reasoning Systems
 4th International Conference on CaseBased Reasoning (ICCBR), SpringerVerlag
, 2001
"... The maintenance of casebased reasoning systems is remarkably important for the continuous working ability of casebased reasoning applications. ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
The maintenance of casebased reasoning systems is remarkably important for the continuous working ability of casebased reasoning applications.
A systematic approach to network coding problems using conflict graphs
 IN PROC. ITA, FEB. 2006. IEEE/ACM TRANSACTIONS ON NETWORKING, VOL
, 2010
"... We present a new approach to network coding problems that could lead to a systematic method for deciding solvability of a given network. The approach is based on a graph theoretic formulation of the problem. The constraints at each node in the network are represented using hyperedges in a ‘conflic ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
‘conflict’ hypergraph. This representation reduces the solvability question to that of finding a stable set with certain properties in a hypergraph. The approach is sufficiently general to allow even nonlinear codes by suitably modifying the conflict graph. We also demonstrate the use of the conflict graph
Results 1  10
of
960