Global optimality conditions and optimization methods for quadratic integer programming problems
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Djerdjour, Mohamed, 1997. "An enumerative algorithm framework for a class of nonlinear integer programming problems," European Journal of Operational Research, Elsevier, vol. 101(1), pages 104-121, August.
- Gupta, Renu & Bandopadhyaya, Lakshmisree & Puri, M. C., 1996. "Ranking in quadratic integer programming problems," European Journal of Operational Research, Elsevier, vol. 95(1), pages 231-236, November.
- Vassilev, Vassil & Genova, Krassimira, 1994. "An approximate algorithm for nonlinear integer programming," European Journal of Operational Research, Elsevier, vol. 74(1), pages 170-178, April.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Chunli Liu & Jianjun Gao, 2015. "A polynomial case of convex integer quadratic programming problems with box integer constraints," Journal of Global Optimization, Springer, vol. 62(4), pages 661-674, August.
More about this item
KeywordsGlobal optimality conditions; Quadratic integer programming problem; Optimization method; Auxiliary function; 41A65; 41A29; 90C30;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:51:y:2011:i:3:p:549-568. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .