Sciweavers

126 search results - page 7 / 26
» Surrogate constraint normalization for the set covering prob...
Sort
View
MOR
2002
102views more  MOR 2002»
13 years 7 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 ...
EOR
2007
90views more  EOR 2007»
13 years 7 months ago
Arc routing problems with time-dependent service costs
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin
SIAMJO
2011
13 years 2 months ago
Prox-Penalization and Splitting Methods for Constrained Variational Problems
This paper is concerned with the study of a class of prox-penalization methods for solving variational inequalities of the form Ax + NC (x) 0 where H is a real Hilbert space, A : H...
Hedy Attouch, Marc-Olivier Czarnecki, Juan Peypouq...
DAC
2009
ACM
14 years 2 months ago
Clock skew optimization via wiresizing for timing sign-off covering all process corners
Manufacturing process variability impacts the performance of synchronous logic circuits by means of its effect on both clock network and functional block delays. Typically, varia...
Sari Onaissi, Khaled R. Heloue, Farid N. Najm
SDM
2008
SIAM
140views Data Mining» more  SDM 2008»
13 years 8 months ago
Creating a Cluster Hierarchy under Constraints of a Partially Known Hierarchy
Although clustering under constraints is a current research topic, a hierarchical setting, in which a hierarchy of clusters is the goal, is usually not considered. This paper trie...
Korinna Bade, Andreas Nürnberger