Sciweavers

3250 search results - page 69 / 650
» An Algorithm to Solve a Linear Program
Sort
View
IPPS
1998
IEEE
15 years 2 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
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 ...
Peter R. Cappello, Ömer Egecioglu
EOR
2010
149views more  EOR 2010»
14 years 9 months ago
Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
Outer linearization methods for two-stage stochastic linear programs with recourse, such as the L-shaped algorithm, generally apply a single optimality cut on the nonlinear object...
Svyatoslav Trukhanov, Lewis Ntaimo, Andrew Schaefe...
AAAI
2000
14 years 11 months ago
Solving a Supply Chain Optimization Problem Collaboratively
We propose a novel algorithmic framework to solve an integrated planning and scheduling problem in supply chain management. This problem involves the integration of an inventory m...
Hoong Chuin Lau, Andrew Lim, Qi Zhang Liu
GECCO
2003
Springer
121views Optimization» more  GECCO 2003»
15 years 2 months ago
Evolving Hogg's Quantum Algorithm Using Linear-Tree GP
Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In thi...
André Leier, Wolfgang Banzhaf
SODA
1998
ACM
114views Algorithms» more  SODA 1998»
14 years 11 months ago
Exact Arithmetic at Low Cost - A Case Study in Linear Programming
We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...
Bernd Gärtner