Sciweavers

5241 search results - page 800 / 1049
» Embedded Programming with C
Sort
View
157
Voted
HEURISTICS
1998
103views more  HEURISTICS 1998»
15 years 3 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
DAM
1999
132views more  DAM 1999»
15 years 3 months ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
Giovanni Righini, Marco Trubian
MSCS
1998
58views more  MSCS 1998»
15 years 3 months ago
Minimal Realization in Bicategories of Automata
The context of this article is the program to develop monoidal bicategories with a feedback operation as an algebra of processes, with applications to concurrency theory. The obje...
Robert D. Rosebrugh, Nicoletta Sabadini, Robert F....
ORL
1998
136views more  ORL 1998»
15 years 3 months ago
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
Fabián A. Chudak, Michel X. Goemans, Dorit ...
SIAMJO
2002
99views more  SIAMJO 2002»
15 years 3 months ago
On the Calmness of a Class of Multifunctions
The paper deals with the calmness of a class of multifunctions in finite dimensions. Its first part is devoted to various conditions for calmness, which are derived in terms of cod...
René Henrion, Abderrahim Jourani, Jir&iacut...