Constrained discriminant analysis via 0/1 mixed integer programming

Author： Gallagher R.J.   Lee E.K.   Patterson D.A.  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.74, Iss.1, 1997-01, pp. : 65-88

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles

By Sniezek John  

Annals of Operations Research, Vol. 144, Iss. 1, 2006-04 ,pp. : 33-58

Springer Publishing Company

Access to resources Recommend Favorite

Elastic Constraint Branching, the Wedelin/Carmen Lagrangian Heuristic and Integer Programming for Personnel Scheduling

By Mason A.J.  

Annals of Operations Research, Vol. 108, Iss. 1-4, 2001-11 ,pp. : 239-276

Springer Publishing Company

Access to resources Recommend Favorite

A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem

By Morabito Reinaldo  

Annals of Operations Research, Vol. 179, Iss. 1, 2010-09 ,pp. : 297-315

Springer Publishing Company

Access to resources Recommend Favorite

“Miniaturized” Linearizations for Quadratic 0/1 Problems

By Gueye Serigne  

Annals of Operations Research, Vol. 140, Iss. 1, 2005-11 ,pp. : 235-261

Springer Publishing Company

Access to resources Recommend Favorite

Mixed-integer programming—1968 and thereafter

By Padberg Manfred  

Annals of Operations Research, Vol. 149, Iss. 1, 2007-02 ,pp. : 163-175

Springer Publishing Company

Access to resources Recommend Favorite