An improved algorithm to compute the -primality
From MaRDI portal
Publication:1996743
Abstract: In this paper, we present an improved methodology to compute -invariant of numerical semigroup. The approach is based on adapting a recent resolution method for optimizing a linear function over the set of efficient solutions of a multiple objective integer linear programming problem. The numerical experiments show the efficiency of the proposed technique compared to the existing methods.
Recommendations
- Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.
- A mathematical programming approach to the computation of the omega invariant of a numerical semigroup
- An algorithm to compute -primality in a numerical monoid.
- Measuring primality in numerical semigroups with embedding dimension three.
- How do you measure primality?
Cites work
- scientific article; zbMATH DE number 5735012 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- A mathematical programming approach to the computation of the omega invariant of a numerical semigroup
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- Algorithms for the vector maximization problem
- An algorithm for optimizing a linear function over an integer efficient set
- An algorithm to compute \(\omega\)-primality in a numerical monoid.
- An application of integer programming to the decomposition of numerical semigroups
- Arithmetic of Mori domains and monoids
- Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.
- Counting numerical semigroups with short generating functions.
- Factorization invariants in numerical monoids
- HOW FAR IS AN ELEMENT FROM BEING PRIME?
- How do you measure primality?
- Irreducibility in the set of numerical semigroups with fixed multiplicity.
- Local tameness of \(v\)-Noetherian monoids.
- Minimum maximal flow problem: An optimization over the efficient set
- Multicriteria optimization
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- Non-unique factorizations: a survey
- Numerical semigroups.
- On dynamic algorithms for factorization invariants in numerical monoids
- On the arithmetic of strongly primary monoids.
- On the enumeration of the set of numerical semigroups with fixed Frobenius number.
- Optimization of a linear function over the set of stochastic efficient solutions
- Optimization over the efficient set
- Optimization over the efficient set: overview
- Optimizing Over the Efficient Set Using a Top-Down Search of Faces
- Optimizing a linear function over an efficient set
- Optimizing a linear function over an integer efficient set
- Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids.
- The catenary and tame degree of numerical monoids generated by generalized arithmetic sequences.
- The computation of factorization invariants for affine semigroups
- The set of numerical semigroups of a given genus.
- The tree of irreducible numerical semigroups with fixed Frobenius number
- numericalsgps, a GAP package for numerical semigroups
Cited in
(6)- Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.
- An improved exact algorithm for the domatic number problem
- A mathematical programming approach to the computation of the omega invariant of a numerical semigroup
- scientific article; zbMATH DE number 5876376 (Why is no real title available?)
- scientific article; zbMATH DE number 962546 (Why is no real title available?)
- scientific article; zbMATH DE number 6266501 (Why is no real title available?)
This page was built for publication: An improved algorithm to compute the \(\omega\)-primality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1996743)
