4047 search results - page 95 / 810 » Some Properties and Some Problems on Set Functors |
140
click to vote
MOR
2007
15 years 4 months ago
2007
The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the profits of each of the edges is maximized. The set M is...
140
click to vote
ENDM
2010
15 years 4 months ago
2010
We propose a 0/1 integer programming model to tackle the office space allocation (OSA) problem which refers to assigning room space to a set of entities (people, machines, roles, ...
143
click to vote
PAMI
2002
15 years 4 months ago
2002
Tracking regions in an image sequence is a challenging and di cult problem in image processing and computer vision, and at the same time, one that has many important applications:...
126
click to vote
MP
2010
15 years 2 months ago
2010
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
155
click to vote
CONSTRAINTS
2007
15 years 4 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...