A mathematical programming approach to the computation of the omega invariant of a numerical semigroup

DOI10.1016/J.EJOR.2011.07.004zbMATH Open1242.90107OpenAlexW2028898769MaRDI QIDQ420862FDOQ420862

Authors: Víctor Blanco 

Publication date: 23 May 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.07.004

Recommendations

• An improved algorithm to compute the \(\omega\)-primality
• Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.
• Measuring primality in numerical semigroups with embedding dimension three.
• An algorithm to compute \(\omega\)-primality in a numerical monoid.
• On the linearity of \(\omega\)-primality in numerical monoids.

zbMATH Keywords

numerical semigroupsfactorization theoryoptimization over an efficient set

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Integer programming (90C10) Commutative semigroups (20M14)

Cites Work

• Title not available (Why is that?)
• Multicriteria dynamic programming with an application to the integer case
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• Title not available (Why is that?)
• Numerical semigroups.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimization over the efficient set
• Optimization over the efficient set: overview
• The catenary and tame degree of numerical monoids
• Multi-objective integer programming: a general approach for generating all non-dominated solutions
• Title not available (Why is that?)
• An algorithm for optimizing a linear function over an integer efficient set
• An algebraic approach to integer portfolio problems
• An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
• Arithmetic of Mori domains and monoids
• On the arithmetic of tame monoids with applications to Krull monoids and Mori domains.
• Local tameness of \(v\)-Noetherian monoids.
• An algorithm to compute \(\omega\)-primality in a numerical monoid.
• Short rational generating functions for lattice point problems
• Integer programming, Barvinok's counting algorithm and Gomory relaxations.
• On full affine semigroups
• Optimizing a linear function over an integer efficient set
• Short rational functions for toric algebra and applications
• Pareto optima of multicriteria integer linear programs
• A Survey of Multiple Criteria Integer Programming Methods
• Partial Gröbner bases for multiobjective integer linear optimization
• A Class of Hard Small 0-1 Programs
• A new complexity result on multiobjective linear integer programming using short rational generating functions

Cited In (4)

• Factorization invariants in numerical monoids
• Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics
• An improved algorithm to compute the \(\omega\)-primality
• A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems

Uses Software

• numericalsgps

This page was built for publication: A mathematical programming approach to the computation of the omega invariant of a numerical semigroup

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q420862)