16404 search results - page 364 / 3281 » A set coverage problem |
136
click to vote
JGO
2008
15 years 5 months ago
2008
Abstract. We deal with duality for almost convex finite dimensional optimization problems by means of the classical perturbation approach. To this aim some standard results from th...
150
click to vote
JAL
2006
15 years 5 months ago
2006
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
139
click to vote
ORL
2008
15 years 5 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
159
click to vote
NETWORKS
2007
15 years 4 months ago
2007
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
128
click to vote
IAT
2006
IEEE
15 years 11 months ago
2006
IEEE
We present a new approach to distributed problem solving based on high-level program execution. While this technique has proven itself for single-agent systems based on the Golog ...