Technical Note—On the Generalized Lattice Point Problem and Nonlinear Programming
From MaRDI portal
Publication:4068446
Cited in
(6)- A branch and bound algorithm for extreme point mathematical programming problems
- A finite procedure to generate feasible points for the extreme point mathematical programming problem
- Membership functions, some mathematical programming models and production scheduling
- A finite algorithm for solving the generalized lattice point problem
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
- An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
This page was built for publication: Technical Note—On the Generalized Lattice Point Problem and Nonlinear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4068446)