Closed-form formulas for evaluating r-flip moves to the unconstrained binary quadratic programming problem

DOI10.1016/J.COR.2019.104774zbMATH Open1458.90501OpenAlexW2969799488WikidataQ127337530 ScholiaQ127337530MaRDI QIDQ2333129FDOQ2333129

Authors: Eduardo A. J. Anacleto, Santiago Valdés Ravelo, Cláudio N. Meneses 

Publication date: 11 November 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.104774

Recommendations

• Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints
• Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems
• \(f\)-flip strategies for unconstrained binary quadratic programming
• The unconstrained binary quadratic programming problem: a survey
• Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem

zbMATH Keywords

computational efficiencyzero-one optimizationunconstrained binary quadratic programmingfast flip moves

Mathematics Subject Classification ID

Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Boolean programming (90C09)

Cites Work

• Constrained global optimization: algorithms and applications
• Path relinking for unconstrained binary quadratic programming
• Probabilistic GRASP-tabu search algorithms for the UBQP problem
• The unconstrained binary quadratic programming problem: a survey
• A Decomposition Method for Quadratic Zero-One Programming
• Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
• Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems
• Variable neighborhood search: Principles and applications
• A global continuation algorithm for solving binary quadratic programming problems
• Solving the maximum vertex weight clique problem via binary quadratic programming
• An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
• The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
• Adaptive memory tabu search for binary quadratic programs
• A hybrid metaheuristic approach to solving the UBQP problem
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
• A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
• The cut polytope and the Boolean quadric polytope
• A linearization framework for unconstrained quadratic (0-1) problems
• A solvable case of quadratic 0-1 programming
• Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
• Graph separation techniques for quadratic zero-one programming
• An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
• Solving unconstrained binary quadratic programming problem by global equilibrium search
• Exact solutions to generalized vertex covering problems: a comparison of two models
• Unconstrained quadratic bivalent programming problem
• A solvable class of quadratic 0-1 programming
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models

Cited In (4)

• \(f\)-flip strategies for unconstrained binary quadratic programming
• Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems
• Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation
• Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints

This page was built for publication: Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem

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