Buchberger Algorithm and Integer Programming

No abstract is available for this paper.

• Publication year

  1991

• Venue

  International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

• Publication date

  1991-10-07

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/3-540-54522-0_102
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• “One sugar cube, please” or selection strategies in the Buchberger algorithm

  1991cited by this paper
• Minimal Solutions of Linear Diophantine Systems: Bounds and Algorithms

  1991cited by this paper
• Experimenting the Gröbner basis algorithm with the A1PI system

  1989cited by this paper
• Using Gröbner Bases to Determine Algebra Membership Split Surjective Algebra Homomorphisms Determine Birational Equivalence

  1988cited by this paper
• Term Orderings on the Polynominal Ring

  1985cited by this paper
• A constructive approach to commutative ring theory

  1977cited by this paper

• Integer programming with binary and bounded variables via Gröbner bases with applications to multiobjective integer programming

  2026cites this paper
• Learning Fast Monomial Orders for Gr\"obner Basis Computations

  2026cites this paper
• Improving Directions in Mixed Integer Bilevel Linear Optimization

  2025cites this paper
• Exploring the Geometric Buchberger Algorithm in Integer Programming

  2024cites this paper
• On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem

  2023influential citation
• Computing local minimizers in polynomial optimization under genericity conditions

  2023cites this paper
• Gr\"obner and Graver bases for calculating Opportunity Cost Matrices

  2023cites this paper
• Time-reversibility and integrability of $ p:-q $ resonant vector fields

  2022cites this paper
• Quantum Integer Programming (QuIP) 47-779: Lecture Notes

  2020cites this paper
• Learning selection strategies in Buchberger's algorithm

  2020cites this paper
• GAMA: A Novel Algorithm for Non-Convex Integer Programs

  2019cites this paper
• Applying Gröbner Basis Method to Multiparametric Polynomial Nonlinear Programming

  2019cites this paper
• Solving System of Linear Congruence Equations over some Rings by Decompositions of Modules

  2019cites this paper
• Minimizing polynomial functions on quantum computers

  2019cites this paper
• Graver Bases via Quantum Annealing with Application to Non-Linear Integer Programs

  2019cites this paper
• A Novel Algebraic Geometry Compiling Framework for Adiabatic Quantum Computations

  2018cites this paper
• Finding Multiple Solutions in Nonlinear Integer Programming with Algebraic Test-Sets

  2018cites this paper
• An algebraic algorithm for solving parametric integer programs

  2017cites this paper
• Gröbner bases and their application to the Cauchy problem on finitely generated affine monoids

  2017cites this paper
• Métodos algebraicos basados en test-sets para optimización lineal entera multiobjetivo

  2017influential citation
• Gröbner Bases over Finitely Generated Affine Monoids and Applications . The Direct Sum Case

  2016influential citation
• Linear Diophantine equations and applications

  2015cites this paper
• Identifying All Moiety Conservation Laws in Genome-Scale Metabolic Networks

  2014influential citation
• Gröbner Basis and Its Applications

  2014cites this paper
• An Algebraic Method for Decoding q-ary Codes via Submodules of Z^n

  2014influential citation
• Solving linear systems of equations over integers with Gröbner bases

  2014influential citation
• A Divide and Conquer Method to Compute Binomial Ideals

  2014cites this paper
• Gröbner bases of toric ideals and their application

  2014cites this paper
• Solving Polynomial Systems over Finite Fields: Algorithms, Implementation and Applications

  2013cites this paper
• Grobner Bases for Lattices and an Algebraic Decoding Algorithm

  2013cites this paper
• Solving Systems of Polynomial Equations Using Gröbner Bases

  2013cites this paper
• On Groebner Bases and Their Use in Solving Some Practical Problems

  2013cites this paper
• A Combinatorial Commutative Algebra Approach to Complete Decoding

  2013cites this paper
• Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method

  2013cites this paper
• A Quick Introduction to Gröbner Bases

  2013cites this paper
• A Combinatorial Commutative Algebra Approach to Complete Decoding

  2013influential citation
• Universal Gröbner Bases for Binary Linear Codes

  2013cites this paper
• Identifying all irreducible conserved metabolite pools in genome-scale metabolic networks: a general method and the case of Escherichia coli

  2013cites this paper
• Enumerating polytropes

  2013cites this paper
• Representing and solving finite-domain constraint problems using systems of polynomials

  2013cites this paper
• eu COMPUTING GENERATING SETS FOR QUATERNARY CODES USING GRÖBNER BASES

  2013cites this paper
• A Variant of the Gröbner Basis Algorithm for Computing Hilbert Bases

  2013cites this paper
• Algebraic theory of affine monoids

  2013cites this paper
• Exact cost minimization of a series-parallel system

  2012cites this paper
• Applying Stochastic Integer Programming to Optimization of Resource Scheduling in Cloud Computing

  2012cites this paper
• Decomposition of Modular Codes for Computing Test Sets and Graver Basis

  2012cites this paper
• MATH 328 Computational Algebra Fall 2012

  2012cites this paper
• An Application of Integer Programming to the Decomposition of Numerical Semigroups

  2012cites this paper
• An Algebraic Exploration of Dominating Sets and Vizing's Conjecture

  2012cites this paper
• Foundations of Discrete Optimization: In Transition from Linear to Non-linear Models and Methods

  2012cites this paper
• An Optimal Model and Solution for Resource Scheduling in Cloud Computing

  2012cites this paper
• A mathematical programming approach to the computation of the omega invariant of a numerical semigroup

  2011cites this paper
• The combinatorics of modeling and analyzing biological systems

  2011cites this paper
• An Optimal Algorithm for Resource Scheduling in Cloud Computing

  2011cites this paper
• Algebraic structure of the minimal support codewords set of some linear codes

  2011influential citation
• Integer Programming and m-irreducibility of numerical semigroups

  2011cites this paper
• A saturation algorithm for homogeneous binomial ideals

  2011cites this paper
• An algebraic approach to integer portfolio problems

  2010influential citation
• Optimization of Resource Scheduling in Cloud Computing

  2010cites this paper
• Maximum likelihood detection for DS-CDMA using Gröbner bases

  2010cites this paper
• Computing solution concepts in games with integer decisions

  2010cites this paper
• Voronoi Diagrams on Periodic Graphs

  2010cites this paper
• On the computation of the Omega invariant of a numerical semigroup by optimizing over an efficient integer set

  2010cites this paper
• Root Isolation of Zero-dimensional Polynomial Systems with Linear Univariate Representation ( Abstract ) ∗

  2010cites this paper
• Gröbner bases of contraction ideals

  2010cites this paper
• COSOR 97-09 A decade of combinatorial optimization

  2010cites this paper
• Generalized Reduction to Compute toric ideals

  2009cites this paper
• Computing generating sets of lattice ideals and Markov bases of lattices

  2009cites this paper
• A Survey on Polly Cracker Systems

  2009cites this paper
• Some algebraic methods for solving multiobjective polynomial integer programs

  2009cites this paper
• Solving Thousand Digit Frobenius Problems

  2008cites this paper
• Alternatives for testing total dual integrality

  2008cites this paper
• Analysis of Nonlinear Oscillations Using Computer Algebra

  2008cites this paper
• Characterizations of Total Dual Integrality

  2007cites this paper
• Partial Gröbner Bases for Multiobjective Integer Linear Optimization

  2007influential citation
• On selection of nonmultiplicative prolongations in computation of Janet bases

  2007cites this paper
• FROBENIUS NUMBERS BY LATTICE POINT ENUMERATION

  2007cites this paper
• Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximation Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximation

  2007cites this paper
• Solving thousand-digit Frobenius problems using Gröbner bases

  2007influential citation
• Partial Gr¨obner Bases for Multiobjective Integer Programming

  2007cites this paper
• Grobner Bases for Submodules of Z n

  2007cites this paper
• Computing Markov bases, Gröbner bases, and extreme rays

  2007cites this paper
• Gröbner Bases in Economy

  2007cites this paper
• Problems in computational algebra and integer programming

  2007influential citation
• The intersection of commutative algebra and algebraic geometry with combinatorics and discrete geometry is a rich and expanding field. Integral polytopes, purely discrete objects, provide enlight-

  2006cites this paper
• Representations of lattice point sets

  2006cites this paper
• Computing generating sets of lattice ideals 1

  2006influential citation
• Sequential importance sampling for multiway tables

  2006cites this paper
• On Computing Janet Bases for Degree Compatible Orderings

  2006cites this paper
• Computing generating sets of lattice ideals 1

  2006cites this paper
• Truncated Markov bases and Gr\"obner bases for Integer Programming

  2006cites this paper
• Making Change and Finding Repfigits: Balancing a Knapsack

  2006cites this paper
• The generic Gröbner walk

  2005cites this paper
• NUMBERS OF PRIMAL AND DUAL BASES OF NETWORK FLOW AND UNIMODULAR INTEGER PROGRAMS

  2005influential citation
• Janet Bases of Toric Ideals

  2005cites this paper
• The C3 Theorem and a D2 Algorithm for Large Scale Stochastic Mixed-Integer Programming: Set Convexification

  2005cites this paper
• Initial ideals of unimodular integer programs

  2005influential citation
• STATEMENT OF RESEARCH INTERESTS

  2004cites this paper
• Sums of Squares Optimization via Semidefinite Programming

  2004influential citation
• N-solutions to linear systems over Z

  2004cites this paper