Sciweavers

2109 search results - page 57 / 422
» Solving Necklace Constraint Problems
Sort
View
CPAIOR
2011
Springer
14 years 8 months ago
Optimization Methods for the Partner Units Problem
In this work we present the Partner Units Problem as a novel challenge for optimization methods. It captures a certain type of configuration problem that frequently occurs in indu...
Markus Aschinger, Conrad Drescher, Gerhard Friedri...
HIS
2009
15 years 2 months ago
A Particle Swarm Optimization with Feasibility-Based Rules for Mixed-Variable Optimization Problems
A Particle Swarm Optimization algorithm with feasibility-based rules (FRPSO) is proposed in this paper to solve mixed-variable optimization problems. An approach to handle various ...
Chao-Li Sun, Jian-Chao Zeng, Jeng-Shyang Pan
SIAMJO
2011
14 years 11 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...
GI
2009
Springer
15 years 9 months ago
Constraint Checking for Business Process Management
: Compliance management tackles issues related to both modelling and enforcement of business constraints in enterprises. In the context of business process management, we propose a...
Wolfgang Runte, Marwane El Kharbili
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 1 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker