Sciweavers

4 search results - page 1 / 1
» Duality for location problems with unbounded unit balls
Sort
View
EOR
2007
113views more  EOR 2007»
13 years 6 months ago
Duality for location problems with unbounded unit balls
Abstract. Given an optimization problem with a composite of a convex and componentwise increasing function with a convex vector function as objective function, by means of the conj...
Gert Wanka, Radu Ioan Bot, Emese Vargyas
CORR
2011
Springer
147views Education» more  CORR 2011»
13 years 1 months ago
On Reachability for Hybrid Automata over Bounded Time
This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target locat...
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, J...
SIAMDM
2010
194views more  SIAMDM 2010»
13 years 1 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...
COCOA
2008
Springer
13 years 8 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth