On nonlinear optimization in integers

DOI10.1002/NAV.3800150102zbMATH Open0159.48502OpenAlexW1515944945MaRDI QIDQ5545145FDOQ5545145

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

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

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)