Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case

Author： Heesang L. Nemhauser G.L. Yinhua W.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.94, Iss.1, 1996-10, pp. : 154-166

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

Ranking in quadratic integer programming problems

By Gupta R. Bandopadhyaya L. Puri M.C.

European Journal of Operational Research, Vol. 95, Iss. 1, 1996-11 ,pp. : 231-236

Elsevier

Access to resources Recommend Favorite

A new penalty function algorithm for convex quadratic programming

By Ben-Daya M. Al-Sultan K.S.

European Journal of Operational Research, Vol. 101, Iss. 1, 1997-08 ,pp. : 155-163

Elsevier

Access to resources Recommend Favorite

An algorithm for the multiparametric 0-1-integer linear programming problem relative to the objective function

By Crema A.

European Journal of Operational Research, Vol. 125, Iss. 1, 2000-08 ,pp. : 18-24

Elsevier

Access to resources Recommend Favorite

QFD-based modular product design with linear integer programming--a case study

By Kreng Victor

Journal of Engineering Design, Vol. 15, Iss. 3, 2004-06 ,pp. : 261-284

Taylor & Francis Ltd

Access to resources Recommend Favorite

On computing objective function values in multiple objective quadratic-linear programming

By Korhonen P. Yu G.Y.

European Journal of Operational Research, Vol. 106, Iss. 1, 1998-04 ,pp. : 184-190

Elsevier

Access to resources Recommend Favorite