New variants of the criss-cross method for linearly constrained convex quadratic programming

Akkele, A.A. and Balogh, L. and Illes, T. (2004) New variants of the criss-cross method for linearly constrained convex quadratic programming. European Journal of Operational Research, 157 (1). pp. 74-86. ISSN 0377-2217 (http://dx.doi.org/10.1016/j.ejor.2003.08.008)

ORCID iDs

Illes, T. ORCID: https://orcid.org/0000-0002-5396-3148

• Share and Export
  

  ReferAtomJSONOpenURL ContextObject in SpanMPEG-21 DIDLRDF+XMLRDF+N-TriplesRefWorksHTML CitationEndNoteMultiline CSVRIS (EndNote Online, Zotero, Ref manager, etc)Data Cite XMLDublin CoreEP3 XMLASCII CitationRDF+N3METSSimple MetadataRIOXX2 XMLBibTeXOpenURL ContextObjectMODS
• Item metadata

  Item type:	Article
  ID code:	9198
  Dates:	Date Event 16 August 2004 Published
  Subjects:	Social Sciences > Industries. Land use. Labor > Management. Industrial Management
  Department:	Strathclyde Business School > Management Science
  Depositing user:	Strathprints Administrator
  Date deposited:	26 Mar 2010 14:55
  Last modified:	11 Nov 2024 08:57
  URI:	https://strathprints.strath.ac.uk/id/eprint/9198