110 search results - page 18 / 22 » endm 2010 |
ENDM
2007
13 years 7 months ago
2007
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this...
ENDM
2010
13 years 7 months ago
2010
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
ENDM
2010
13 years 7 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, ...
ENDM
2010
13 years 7 months ago
2010
Trading decisions in financial markets can be supported by the use of online algorithms. We evaluate the empirical performance of a threat-based online algorithm and compare it to...
ENDM
2010
13 years 4 months ago
2010
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...