Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm

ISSN： 0938-1279

Source： Applicable Algebra in Engineering, Communication and Computing, Vol.25, Iss.1-2, 2014-04, pp. : 99-117

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Gröbner Basis Representations of Sudoku

By Arnold Elizabeth Lucas Stephen Taalman Laura

The College Mathematics Journal, Vol. 41, Iss. 2, 2010-03 ,pp. : 101-112

Mathematical Association of America

Access to resources Recommend Favorite

Parallel algorithms for Gröbner-basis construction

By Mityunin V. Pankratiev E.

Journal of Mathematical Sciences, Vol. 142, Iss. 4, 2007-04 ,pp. : 2248-2266

Springer Publishing Company

Access to resources Recommend Favorite

A hybrid direction algorithm for solving linear programs

International Journal of Computer Mathematics, Vol. 92, Iss. 1, 2015-01 ,pp. : 201-216

Taylor & Francis Ltd

Access to resources Recommend Favorite

An O(T log T) Algorithm for the Dynamic Lot Size Problem with Limited Storage and Linear Costs

By Sedeño-Noda A. Gutiérrez J. Abdul-Jalbar B. Sicilia J.

Computational Optimization and Applications, Vol. 28, Iss. 3, 2004-09 ,pp. : 311-323

Springer Publishing Company

Access to resources Recommend Favorite

On the Gröbner basis triangularization of constraint equations in natural coordinates

By Uchida Thomas Callejo Alfonso García de Jalón Javier McPhee John

Multibody System Dynamics, Vol. 31, Iss. 3, 2014-03 ,pp. : 371-392

Springer Publishing Company

Access to resources Recommend Favorite