scientific article
From MaRDI portal
Publication:3312306
zbMath0531.10012MaRDI QIDQ3312306
No author found.
Publication date: 1983
Full work available at URL: https://eudml.org/doc/92187
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
integer programmingdynamic programmingnonlinear programminghighly composite numberstableEverett theoremgeneralized Lagrange multipliers methodNicolas benefit method
Integer programming (90C10) Software, source code, etc. for problems pertaining to number theory (11-04) Distribution of integers with specified multiplicative constraints (11N25)
Related Items (6)
New upper bounds for the number of divisors function ⋮ Landau's function for one million billions ⋮ Highly composite numbers and the Riemann hypothesis ⋮ Estimating the counts of Carmichael and Williams numbers with small multiple seeds ⋮ The least primitive root modulo \(p^2\) ⋮ Some open questions
Cites Work
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Sur un probleme d'optimisation en nombres entiers
- Extensions of Lagrange Multipliers in Nonlinear Programming
- Répartition Des Nombres Hautement Composés de Ramanujan
- On Highly Composite and Similar Numbers
- On Highly Composite Numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
