On nonlinear optimization in integers

DOI10.1002/NAV.3800150102MaRDI QIDQ5545145zbMATH OpenOpenAlexFDO

Authors Thomas L. Saaty

Publication date 1968

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800150102

zbMATH Keywords

operations research

Cites work

• scientific article; zbMATH DE number 3155844 (Why is no real title available?)
• scientific article; zbMATH DE number 3219393 (Why is no real title available?)
• scientific article; zbMATH DE number 3277146 (Why is no real title available?)
• A primal (all-integer) integer programming algorithm
• An All-Integer Programming Algorithm with Parabolic Constraints
• Discrete Optimization Via Marginal Analysis
• Generalized Cuts in Diophantine Programming
• Integer Programming and Pricing
• Integer Programming: Methods, Uses, Computations
• On the distribution of the solutions of diophantine equations with many unknows
• On the integer solutions of \(y(y+1) = x(x+1) (x+2)\)
• Some Diophantine inequalities
• The Theory and Computation of Knapsack Functions
• The solubility of certain Diophantine inequalities

Cited in

(1)

• Optimal choice of discriminators in a balanced K-D binary search tree

This page was built for publication: On nonlinear optimization in integers

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