scientific article; zbMATH DE number 3821078

MaRDI QIDQ3667913zbMATH OpenFDO

Authors William Conley

Publication date 1980

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of software (68N99)

Cited in

(11)

• Monte Carlo optimization
• A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
• Finding discrete global minima with a filled function for integer programming
• Discrete filled function method for discrete global optimization
• A new filled function method for nonlinear integer programming problem
• A note on optimization in integers
• Global optimization algorithm for mixed integer quadratically constrained quadratic program
• An approximate algorithm for nonlinear integer programming
• Duality inequalities as a numerical aid
• Discrete global descent method for discrete global optimization and nonlinear integer programming
• A discrete dynamic convexized method for nonlinear integer programming

This page was built for publication:

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