Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation

DOI10.1016/j.cor.2023.106324MaRDI QIDQ6047870

Eduardo A. J. Anacleto, Ricardo N. Liang, Cláudio N. Meneses

Publication date: 13 September 2023

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

zbMATH Keywords

heuristicsdata structurescomputational efficiencypseudo-Boolean optimizationfast flip moves

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic GRASP-tabu search algorithms for the UBQP problem
• The unconstrained binary quadratic programming problem: a survey
• Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
• Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems
• Pseudo-Boolean optimization
• An unconstrained quadratic binary programming approach to the vertex coloring problem
• A compile/Run-time environment for the automatic transformation of linked list data structures
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
• The Boolean quadratic programming problem with generalized upper bound constraints
• Disjunctive and conjunctive normal forms of pseudo-Boolean functions
• Simplicial degree in complex networks. Applications of topological data analysis to network science
• Path relinking for unconstrained binary quadratic programming
• Polynomial unconstrained binary optimisation -- part 1
• Polynomial unconstrained binary optimisation -- part 2
• Hypergraph cuts above the average
• Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
• Using the unconstrained quadratic program to model and solve Max 2-SAT problems
• Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints
• Partition Crossover for Pseudo-Boolean Optimization

This page was built for publication: Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation