1723 search results - page 105 / 345 » Cycling in linear programming problems |
KBSE
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such sys...
SIAMJO
2011
14 years 5 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
68
Voted
IPL
2007
14 years 10 months ago
2007
Dynamic networks are characterized by transit times on edges. Dynamic flow problems consider transshipment problems in dynamic networks. We introduce a new version of dynamic fl...
100
click to vote
CCE
2010
14 years 7 months ago
2010
In this work we address the problem of solving multiscenario optimization models that are deterministic equivalents of two-stage stochastic programs. We present a heuristic approx...
114
Voted
HASKELL
2006
ACM
15 years 4 months ago
2006
ACM
Many numerical algorithms are specified in terms of operations on vectors and matrices. Matrix operations can be executed extremely efficiently using specialized linear algebra k...