An improved algorithm to compute the -primality
DOI10.1007/S11590-020-01589-WzbMATH Open1460.90161arXiv1809.08497OpenAlexW3026137667MaRDI QIDQ1996743FDOQ1996743
Authors: Wissem Achour, D. Chaabane, Víctor Blanco 
Publication date: 26 February 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.08497
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 \(\omega\)-primality in a numerical monoid.
- Measuring primality in numerical semigroups with embedding dimension three.
- How do you measure primality?
global optimizationnumerical semigroupsoptimization over an efficient setmulti-objective integer programming\(\omega\) primality
Multi-objective and goal programming (90C29) Nonconvex programming, global optimization (90C26) Integer programming (90C10)
Cites Work
- numericalsgps, a GAP package for numerical semigroups
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- Multicriteria optimization
- Title not available (Why is that?)
- Numerical semigroups.
- On the enumeration of the set of numerical semigroups with fixed Frobenius number.
- The set of numerical semigroups of a given genus.
- Counting numerical semigroups with short generating functions.
- Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids.
- Algorithms for the vector maximization problem
- Optimization over the efficient set
- Optimization over the efficient set: overview
- 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 mathematical programming approach to the computation of the omega invariant of a numerical semigroup
- An algorithm for optimizing a linear function over an integer efficient set
- Non-unique factorizations: a survey
- Optimizing Over the Efficient Set Using a Top-Down Search of Faces
- The catenary and tame degree of numerical monoids generated by generalized arithmetic sequences.
- Arithmetic of Mori domains and monoids
- On the arithmetic of strongly primary monoids.
- Local tameness of \(v\)-Noetherian monoids.
- HOW FAR IS AN ELEMENT FROM BEING PRIME?
- An algorithm to compute \(\omega\)-primality in a numerical monoid.
- Irreducibility in the set of numerical semigroups with fixed multiplicity.
- An application of integer programming to the decomposition of numerical semigroups
- Minimum maximal flow problem: An optimization over the efficient set
- Optimizing a linear function over an efficient set
- Optimizing a linear function over an integer efficient set
- On dynamic algorithms for factorization invariants in numerical monoids
- Optimization of a linear function over the set of stochastic efficient solutions
- Title not available (Why is that?)
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- The tree of irreducible numerical semigroups with fixed Frobenius number
- Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.
- Factorization invariants in numerical monoids
- How Do You Measure Primality?
- The computation of factorization invariants for affine semigroups
Cited In (5)
Uses Software
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)
