110 search results - page 12 / 22 » endm 2010 |
ENDM
2010
13 years 1 months ago
2010
In this paper we show and discuss a family of inequalities for solving a variant of the classical vehicle routing problem where also a lower bound is considered. The inequalities ...
ENDM
2010
13 years 4 months ago
2010
This paper addresses the jobshop and the flowshop scheduling problems with minimum and maximum time lags. To solve this kind of problems, we propose adaptations of Climbing Discre...
ENDM
2010
13 years 4 months ago
2010
In this paper, we are interested in the recourse problem of the 2-stage robust location transportation problem. We propose a solution process using a mixed-integer formulation wit...
ENDM
2006
13 years 6 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
ENDM
2007
13 years 6 months ago
2007
For a set of distances D = {d1, . . . , dk} a set A is called D-avoiding if no pair of points of A is at distance di for some i. We show that the density of A is exponentially sma...