Unconstrained quadratic bivalent programming problem

From MaRDI portal
Publication:792219

DOI10.1016/0377-2217(84)90055-9zbMath0536.90063OpenAlexW2002507586MaRDI QIDQ792219

V. P. Gulati, S. K. Gupta, Ashok Kumar Mittal

Publication date: 1984

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90055-9

zbMATH Keywords

computational experienceunconstrained quadratic programmingbranching and pruning algorithmefficient bounding strategies


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Boolean programming (90C09)


Related Items

Mathematical Programming Models and Exact Algorithms, QUBO Software, Building an iterative heuristic solver for a quantum annealer, A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming, Graph separation techniques for quadratic zero-one programming, Computational aspects of a branch and bound algorithm for quadratic zero- one programming, 0-1 Quadratic programming approach for optimum solutions of two scheduling problems, The unconstrained binary quadratic programming problem: a survey, Local Search Based on Genetic Algorithms, An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach, CON due-date determination and sequencing, Models and methods of solution of quadratic integer programming problems, An exact penalty function approach for nonlinear integer programming problems, A constrained nonlinear 0-1 program for data allocation, Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem, Unconstrained quadratic bivalent programming problem



Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:792219&oldid=12726495"
Powered by MediaWiki