1984 search results - page 8 / 397 » The colourful feasibility problem |
MOR
2002
13 years 9 months ago
2002
Semidefinite feasibility problems arise in many areas of operations research. The abstract form of these problems can be described as finding a point in a nonempty bounded convex b...
DAGSTUHL
2008
13 years 11 months ago
2008
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
ORL
2002
13 years 9 months ago
2002
Dial-a-Ride systems involve dispatching a vehicle to satisfy demands from a set of customers who call a vehicle operating agency requesting that an item be picked up from a specif...
HIS
2009
13 years 7 months ago
2009
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 ...
SIAMJO
2000
13 years 9 months ago
2000
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...