Sciweavers

14165 search results - page 237 / 2833
» The generalized two-server problem
Sort
View
DAM
2006
191views more  DAM 2006»
15 years 5 months ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart
INFORMATICALT
2006
77views more  INFORMATICALT 2006»
15 years 5 months ago
Parallel Numerical Algorithms for 3D Parabolic Problem with Nonlocal Boundary Condition
Three parallel algorithms for solving the 3D problem with nonlocal boundary condition are considered. The forward and backward Euler finite-difference schemes, and LOD scheme are t...
Raimondas Ciegis
ENGL
2007
121views more  ENGL 2007»
15 years 5 months ago
A Comparison between Genetic Algorithms and Evolutionary Programming based on Cutting Stock Problem
—Genetic Algorithms (GA) and Evolutionary Programming (EP) are two well-known optimization methods that belong to the class of Evolutionary Algorithms (EA). Both methods have gen...
Raymond Chiong, Ooi Koon Beng
4OR
2004
99views more  4OR 2004»
15 years 5 months ago
Upper bounds for revenue maximization in a satellite scheduling problem
This paper presents upper bounds for the Satellite Revenue Selection and Scheduling problem (SRSS). A compact model of this generalized Prize Collecting Traveling Salesman Problem ...
Thierry Benoist, Benoît Rottembourg
ANOR
2002
88views more  ANOR 2002»
15 years 5 months ago
Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives
Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are ...
Horst W. Hamacher, Martine Labbé, Stefan Ni...