Sciweavers

1433 search results - page 61 / 287
» On Covering Problems of Rado
Sort
View
SIAMCO
2008
83views more  SIAMCO 2008»
14 years 11 months ago
Necessary Conditions for Multiobjective Optimal Control Problems with Free End-Time
Abstract. Necessary conditions of optimality are derived for multiobjective optimal control problems with free end-time, in which the dynamics constraint is modeled as a nonconvex ...
B. T. Kien, N.-C. Wong, J. C. Yao
SIAMCOMP
2008
101views more  SIAMCOMP 2008»
14 years 11 months ago
Combination Can Be Hard: Approximability of the Unique Coverage Problem
We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elemen...
Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiag...
VLDB
1995
ACM
89views Database» more  VLDB 1995»
15 years 3 months ago
Document Management as a Database Problem
abstract of invited paper Document management has many aspects, among them acquisition, storage, retrieval, presentation and processing of documents (work flow). These aspects will...
Rudolf Bayer
SIAMJO
2010
92views more  SIAMJO 2010»
14 years 6 months ago
Inexact Proximal Point Methods for Variational Inequality Problems
We present a new family of proximal point methods for solving monotone variational inequalities. Our algorithm has a relative error tolerance criterion in solving the proximal subp...
Regina Sandra Burachik, Joydeep Dutta
MOR
2002
102views more  MOR 2002»
14 years 11 months ago
Facets of the Complementarity Knapsack Polytope
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...
Ismael R. de Farias Jr., Ellis L. Johnson, George ...