A new penalty parameter for linearly constrained 0--1 quadratic programming problems

DOI10.1007/s11590-012-0458-8zbMath1291.90161OpenAlexW1993886527MaRDI QIDQ1947625

Yong Hsia, Yan-Ping Wang

Publication date: 23 April 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-012-0458-8

zbMATH Keywords

integer programmingpenalty parameterconcave programminglinearly constrained 0--1 quadratic programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Boolean programming (90C09)

Related Items

Exact solutions to generalized vertex covering problems: a comparison of two models

Cites Work

• New results on the equivalence between zero-one programming and continuous concave programming
• New optimality conditions for quadratic optimization problems with binary constraints
• Constrained global optimization: algorithms and applications
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
• Penalty parameter for linearly constrained 0--1 quadratic programming
• New sufficient global optimality conditions for linearly constrained bivalent quadratic optimization problems
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
• Construction of test problems in quadratic bivalent programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item