Sciweavers

291 search results - page 23 / 59
» Constraint Satisfaction: The Approximability of Minimization...
Sort
View
CORR
2011
Springer
220views Education» more  CORR 2011»
13 years 2 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers
IJSN
2006
87views more  IJSN 2006»
13 years 7 months ago
Workflow authorisation in mediator-free environments
: WorkFlow Management Systems (WFMS) coordinate and streamline business processes. Acquiring workflow authorisations and managing workflow authorisation constraints is achallenging...
Mohamed Shehab, Elisa Bertino, Arif Ghafoor
FSTTCS
1993
Springer
13 years 11 months ago
Compact Location Problems
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
Venkatesh Radhakrishnan, Sven Oliver Krumke, Madha...
EOR
2008
80views more  EOR 2008»
13 years 7 months ago
An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
The car sequencing problem consists in sequencing a given set of cars to be produced in a single day. We address one of the variants of this problem, in which the objective of mini...
Celso C. Ribeiro, Daniel Aloise, Thiago F. Noronha...
CPAIOR
2005
Springer
14 years 1 months ago
Constraint Programming Based Column Generation for Employee Timetabling
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...