10182 search results - page 1726 / 2037 » Case Studies |
185
click to vote
MP
2006
15 years 6 months ago
2006
We study two different lot-sizing problems with time windows that have been proposed recently. For the case of production time windows, in which each client specific order must be ...
161
click to vote
SIAMDM
2008
15 years 6 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
133
click to vote
SIAMDM
2008
15 years 6 months ago
2008
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
189
click to vote
SIAMDM
2008
15 years 6 months ago
2008
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
160
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
entation theory, Dung's abstract framework provides a unifying view of several alternative semantics based on the notion of extension. In this context, we propose a general r...