4047 search results - page 372 / 810 » The Discrete Basis Problem |
184
click to vote
CCE
2005
15 years 6 months ago
2005
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
169
click to vote
CCE
2004
15 years 6 months ago
2004
The Resource-Constrained Project Scheduling Problem(RCPSP) is a significant challenge in highly regulated industries, such as pharmaceuticals and agrochemicals, where a large numb...
149
click to vote
CCE
2004
15 years 6 months ago
2004
The problem addressed in this work is to develop a comprehensive mathematical programming model for the efficient scheduling of oil-refinery operations. Our approach is first to d...
158
click to vote
JACM
1998
15 years 5 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
247
click to vote
CAD
2011
Springer
15 years 1 months ago
2011
Springer
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...