Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time
Main Author: | Laurence, Michael Rupen |
---|---|
Published: |
Goldsmiths College (University of London)
2004
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.416038 |
Similar Items
-
Contributions to Linear Programming Theory: Applications to Chebychev and Other Linear Approximation Criteria; The Transportation Problem; and the Problem of Resolution of Degeneracy in Linear programming Alyorithms
by: Appa, G. H.
Published: (1978) -
Interior point methods for nonlinear programming and application to mixed integer nonlinear programming
by: Akrotirianakis, Ioannis
Published: (2011) -
Importance sampling for stochastic programming
by: Tran, Quang Kha
Published: (2016) -
Problem-driven scenario generation for stochastic programs
by: Fairbrother, Jamie
Published: (2016) -
Computational methods for large-scale quadratic programming
by: Morales-Perez, Jose Luis
Published: (1993)