Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations

DOI10.1016/j.disopt.2024.100858MaRDI QIDQ6670500

Abraham P. Punnen, Navpreet Kaur Dhanda

Publication date: 23 January 2025

Published in: Discrete Optimization (Search for Journal in Brave)

Could not fetch data.

Mathematical programming (90Cxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx) Operations research, mathematical programming (90-XX)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Linearizable special cases of the QAP
The unconstrained binary quadratic programming problem: a survey
A new linearization technique for multi-quadratic 0-1 programming problems.
``Miniaturized linearizations for quadratic 0/1 problems
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
A linearization framework for unconstrained quadratic (0-1) problems
Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
On the reduction method for integer linear programs. II
The Boolean quadratic polytope: Some characteristics, facets and relatives
Aggregation of equations in integer programming
A reformulation-linearization technique for solving discrete and continuous nonconvex problems
On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
On aggregating two linear diophantine equations
Tutorial on surrogate constraint approaches for optimization in graphs
A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
A simple recipe for concise mixed 0-1 linearizations
New results for aggregating integer-valued equations
The linearization problem of a binary quadratic problem and its applications
Matheuristics. Algorithms and implementations
Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems
Linear programming insights into solvable cases of the quadratic assignment problem
Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
Compact linearization for binary quadratic problems
Computational aspects of a branch and bound algorithm for quadratic zero- one programming
An O(n⁴) Algorithm for the QAP Linearization Problem
Technical Note—Computational Viability of a Constraint Aggregation Scheme for Integer Linear Programming Problems
A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
On the Significance of Solving Linear Programming Problems with Some Integer Variables
Technical Note—Linearization in 0-1 Variables: A Clarification
Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
L’algebre de Boole et ses applications en recherche operationnelle
Calculating surrogate constraints
Surrogate Constraint Duality in Mathematical Programming
Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
Technical Note—Solving Integer Programming Problems by Aggregating Constraints
Base-2 Expansions for Linearizing Products of Functions of Discrete Variables
The Boolean Quadric Polytope
Mathematical Programming Models and Exact Algorithms
The Quadratic Unconstrained Binary Optimization Problem
SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
Surrogate Constraints
Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
On the partition of numbers.

This page was built for publication: Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations

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