Unconstrained quadratic bivalent programming problem

DOI10.1016/0377-2217(84)90055-9MaRDI QIDQ792219zbMATH OpenOpenAlexFDO

Authors 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

unconstrained quadratic programmingcomputational experiencebranching and pruning algorithmefficient bounding strategies

Mathematics Subject Classification ID

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

Recommendations

• Bivalent quadratic programming problem - A computational study
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
• Experiments in quadratic 0-1 programming
• Construction of test problems in quadratic bivalent programming

Cites work

• scientific article; zbMATH DE number 3643044 (Why is no real title available?)
• scientific article; zbMATH DE number 3473554 (Why is no real title available?)
• scientific article; zbMATH DE number 3476892 (Why is no real title available?)
• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• scientific article; zbMATH DE number 3373921 (Why is no real title available?)
• A Graph-Theoretic Equivalence for Integer Programs
• A Selection Problem of Shared Fixed Costs and Network Flows
• Minimization of pseudo-Boolean functions by binary development
• Minimum cuts and related problems
• On the Maximization of a Pseudo-Boolean Function
• Quadratic Binary Programming with Application to Capital-Budgeting Problems
• Quadratic knapsack problems
• Unconstrained quadratic bivalent programming problem

Cited in

(20)

• A constrained nonlinear 0-1 program for data allocation
• scientific article; zbMATH DE number 2154265 (Why is no real title available?)
• Unconstrained quadratic bivalent programming problem
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Graph separation techniques for quadratic zero-one programming
• The unconstrained binary quadratic programming problem: a survey
• An exact penalty function approach for nonlinear integer programming problems
• A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
• Quadratic optimization in 0-1 variables
• Building an iterative heuristic solver for a quantum annealer
• Local Search Based on Genetic Algorithms
• Analyzing quadratic unconstrained binary optimization problems via multicommodity flows
• An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
• Bivalent quadratic programming problem - A computational study
• 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
• Mathematical programming models and exact algorithms
• Models and methods of solution of quadratic integer programming problems
• CON due-date determination and sequencing
• Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
• QUBO software

This page was built for publication: Unconstrained quadratic bivalent programming problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792219)