4114 search results - page 167 / 823 » Efficient Algorithms for the 2-Center Problems |
152
click to vote
IJCAI
2003
15 years 7 months ago
2003
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
133
Voted
AAAI
1994
15 years 7 months ago
1994
This paper describes an extension to the constraint satisfaction problem (CSP) approach called MUSE CSP (Multiply SEgmented Constraint Satisfaction Problem). This extension is esp...
148
click to vote
ANOR
2008
15 years 6 months ago
2008
We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those obj...
167
click to vote
EOR
2006
15 years 6 months ago
2006
ABSTRACT. We consider equilibrium constrained optimization problems, which have a general formulation that encompasses well-known models such as mathematical programs with equilibr...
137
click to vote
EOR
2007
15 years 6 months ago
2007
The no-fit polygon is a construct that can be used between pairs of shapes for fast and efficient handling of geometry within irregular two-dimensional stock cutting problems. Pre...