Sciweavers

2647 search results - page 14 / 530
» Solving Term Inequalities
Sort
View
FOCS
1990
IEEE
13 years 11 months ago
Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
Noga Alon, Nimrod Megiddo
EOR
2010
140views more  EOR 2010»
13 years 4 months ago
Cutting plane algorithms for 0-1 programming based on cardinality cuts
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
Osman Oguz
RC
2002
100views more  RC 2002»
13 years 7 months ago
Efficient Interval Linear Equality Solving in Constraint Logic Programming
Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving systems of linear constrai...
Chong-Kan Chiu, Jimmy Ho-Man Lee
CP
2001
Springer
13 years 12 months ago
Solving Disjunctive Constraints for Interactive Graphical Applications
In interactive graphical applications we often require that objects do not overlap. Such non-overlap constraints can be modelled as disjunctions of arithmetic inequalities. Unfortu...
Kim Marriott, Peter Moulder, Peter J. Stuckey, Ala...
APPML
2005
52views more  APPML 2005»
13 years 7 months ago
New bounds for the Cebysev functional
Some new inequalities for the Cebysev functional in terms of the first derivative and applications for Taylor's expansion and generalised trapezoid formula are pointed out.
Pietro Cerone, Sever Silvestru Dragomir