A linearization framework for unconstrained quadratic (0-1) problems
From MaRDI portal
Publication:1025991
DOI10.1016/j.dam.2008.01.028zbMath1169.90406OpenAlexW2059396883MaRDI QIDQ1025991
Serigne Gueye, Philippe Yves Paul Michelon
Publication date: 23 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.01.028
Related Items
Mathematical Programming Models and Exact Algorithms, Building an iterative heuristic solver for a quantum annealer, On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study, Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks, Inductive linearization for binary quadratic programs with linear constraints, The unconstrained binary quadratic programming problem: a survey, Compact linearization for binary quadratic problems subject to assignment constraints, \(t\)-linearization for the maximum diversity problem, Theoretical and computational study of several linearisation techniques for binary quadratic problems, Reformulations in Mathematical Programming: Definitions and Systematics, Mixed Integer Linear Programming Formulation Techniques, Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
Cites Work
- Pseudo-Boolean optimization
- Cutting planes in integer and mixed integer programming
- ``Miniaturized linearizations for quadratic 0/1 problems
- Upper-bounds for quadratic 0-1 maximization
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Persistency in quadratic 0-1 optimization
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function
- Minimization of a quadratic pseudo-Boolean function
- A convex envelope formula for multilinear functions
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Evolution and state-of-the-art in integer programming
- An evolutionary heuristic for quadratic 0-1 programming
- The cut polytope and the Boolean quadric polytope
- Greedy and local search heuristics for unconstrained binary quadratic programming
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Unconstrained 0-1 optimization and Lagrangean relaxation
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- A note on the Boolean quadric polytope
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
- A Decomposition Method for Quadratic Zero-One Programming
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Cluster Analysis and Mathematical Programming
- Geometry of cuts and metrics
- Decomposition and linearization for 0-1 quadratic programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
