Sciweavers

284 search results - page 21 / 57
» On Some Polyhedra Covering Problems
Sort
View
JGO
2010
96views more  JGO 2010»
13 years 7 months ago
Duality and optimality conditions for generalized equilibrium problems involving DC functions
We consider a generalized equilibrium problem involving DC functions which is called (GEP). For this problem we establish two new dual formulations based on Toland-Fenchel-Lagrange...
N. Dinh, Jean-Jacques Strodiot, Van Hien Nguyen
MP
2007
100views more  MP 2007»
13 years 8 months ago
Power optimization for connectivity problems
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. ...
MP
2006
138views more  MP 2006»
13 years 8 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...
MOBIHOC
2006
ACM
14 years 8 months ago
Mobile backbone networks --: construction and maintenance
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
Anand Srinivas, Gil Zussman, Eytan Modiano
ICGI
2000
Springer
14 years 13 days ago
Computation of Substring Probabilities in Stochastic Grammars
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
Ana L. N. Fred