Sciweavers

700 search results - page 73 / 140
» words 2005
Sort
View
4OR
2005
104views more  4OR 2005»
14 years 9 months ago
The robust shortest path problem with interval data via Benders decomposition
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
Roberto Montemanni, Luca Maria Gambardella
4OR
2005
158views more  4OR 2005»
14 years 9 months ago
Bilevel programming: A survey
This paper provides an introductory survey of a class of optimization problems known as bilevel programming. We motivate this class through a simple application, and then proceed w...
Benoît Colson, Patrice Marcotte, Gilles Sava...
ACTA
2005
94views more  ACTA 2005»
14 years 9 months ago
The stuttering principle revisited
It is known that LTL formulae without the `next' operator are invariant under the so-called stutter-equivalence of words. In this paper we extend this principle to general LTL...
Antonín Kucera, Jan Strejcek
AML
2005
65views more  AML 2005»
14 years 9 months ago
Middle diamond
Under certain cardinal arithmetic assumptions, we prove that for every large enough regular cardinal, for many regular < , many stationary subsets of concentrating on cofinali...
Saharon Shelah
APAL
2005
93views more  APAL 2005»
14 years 9 months ago
Logical aspects of Cayley-graphs: the group case
Abstract. We prove that a finitely generated group is context-free whenever its Cayleygraph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Sc...
Dietrich Kuske, Markus Lohrey