Pages that link to "Item:Q5906559"
From MaRDI portal
The following pages link to An approximate algorithm for nonlinear integer programming (Q5906559):
Displaying 20 items.
- A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← links)
- An algorithm for non-linear multi-level integer programming problems (Q622833) (← links)
- Global optimality conditions and optimization methods for quadratic integer programming problems (Q652691) (← links)
- An algorithm of internal feasible directions for linear integer programming (Q809890) (← links)
- A discrete dynamic convexized method for nonlinear integer programming (Q953398) (← links)
- Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming (Q1017442) (← links)
- A heuristic algorithm for nonlinear programming (Q1093535) (← links)
- Algorithms for nonlinear integer bicriterion problems (Q1114597) (← links)
- An enumerative algorithm framework for a class of nonlinear integer programming problems (Q1278943) (← links)
- Basic hardware module for a nonlinear programming algorithm and applications (Q1372760) (← links)
- A hybrid approach to resolving a differentiable integer program. (Q1406652) (← links)
- Implementation of the Nielsen algorithm in the algebraic programming system APS-1 (Q1905209) (← links)
- The complexity of approximating a nonlinear program (Q1906280) (← links)
- An algorithm of local search for a class of problems of integer linear programming (Q1974748) (← links)
- Finding discrete global minima with a filled function for integer programming (Q2477662) (← links)
- A new filled function method for nonlinear integer programming problem (Q2489450) (← links)
- (Q4378287) (← links)
- (Q4465182) (← links)
- Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs (Q4944413) (← links)
- An approximate algorithm for nonlinear integer programming (Q5906393) (← links)
