Sciweavers

1984 search results - page 252 / 397
» The colourful feasibility problem
Sort
View
CORR
2002
Springer
135views Education» more  CORR 2002»
15 years 6 months ago
Minimal-Change Integrity Maintenance Using Tuple Deletions
We address the problem of minimal-change integrity maintenance in the context of integrity constraints in relational databases. We assume that integrity-restoration actions are li...
Jan Chomicki, Jerzy Marcinkowski
SIAMJO
2000
108views more  SIAMJO 2000»
15 years 6 months ago
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
Houyuan Jiang, Daniel Ralph
MOR
2002
102views more  MOR 2002»
15 years 6 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 ...
MP
2002
110views more  MP 2002»
15 years 6 months ago
Robust optimization - methodology and applications
Abstract. Robust Optimization (RO) is a modeling methodology, combined with computational tools, to process optimization problems in which the data are uncertain and is only known ...
Aharon Ben-Tal, Arkadi Nemirovski
TKDE
2002
141views more  TKDE 2002»
15 years 6 months ago
Algorithms for Finding Attribute Value Group for Binary Segmentation of Categorical Databases
We consider the problem of finding a set of attribute values that give a high quality binary segmentation of a database. The quality of a segmentation is defined by an objective fu...
Yasuhiko Morimoto, Takeshi Fukuda, Takeshi Tokuyam...