Unconstrained quadratic bivalent programming problem

DOI10.1016/0377-2217(84)90055-9zbMATH Open0536.90063OpenAlexW2002507586MaRDI QIDQ792219FDOQ792219

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Quadratic knapsack problems
• Title not available (Why is that?)
• Quadratic Binary Programming with Application to Capital-Budgeting Problems
• Minimum cuts and related problems
• A Selection Problem of Shared Fixed Costs and Network Flows
• Unconstrained quadratic bivalent programming problem
• On the Maximization of a Pseudo-Boolean Function
• Title not available (Why is that?)
• Minimization of pseudo-Boolean functions by binary development
• A Graph-Theoretic Equivalence for Integer Programs

Cited In (20)

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

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)