1723 search results - page 186 / 345 » Cycling in linear programming problems |
ISQED
2005
IEEE
15 years 3 months ago
2005
IEEE
Reliability decisions taken early in system design can bring significant benefits in terms of design quality. This paper presents a 0-1 integer linear programming (ILP) formulatio...
CP
2005
Springer
15 years 3 months ago
2005
Springer
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
COLT
1998
Springer
15 years 2 months ago
1998
Springer
We introduce and analyze a new algorithm for linear classification which combines Rosenblatt's perceptron algorithm with Helmbold and Warmuth's leave-one-out method. Like...
SIAMJO
2008
14 years 9 months ago
2008
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...