Inductive linearization for binary quadratic programs with linear constraints: a computational study

DOI10.1007/S10288-023-00537-5MaRDI QIDQ6489313zbMATH OpenFDO

Authors Sven Mallach

Publication date 21 April 2024

Published in 4OR (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Mathematics Subject Classification ID

Quadratic programming (90C20) Linear programming (90C05) Nonlinear programming (90C30) General topics of discrete mathematics in relation to computer science (68R01) Integer programming (90C10) Mixed integer programming (90C11) Boolean programming (90C09)

Cites work

• scientific article; zbMATH DE number 714527 (Why is no real title available?)
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• A memetic heuristic for the generalized quadratic assignment problem
• A natural quadratic approach to the generalized graph layering problem
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• A semidefinite programming approach to the quadratic knapsack problem
• Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
• Assignment Problems and the Location of Economic Activities
• Best reduction of the quadratic semi-assignment problem
• Compact linearization for binary quadratic problems
• Compact linearization for binary quadratic problems subject to assignment constraints
• Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays
• Inductive linearization for binary quadratic programs with linear constraints
• Linear programming for the \(0-1\) quadratic knapsack problem
• On the quadratic assignment problem
• QAPLIB - a quadratic assignment problem library
• QPLIB: a library of quadratic programming instances
• Roof duality, complementation and persistency in quadratic 0–1 optimization
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• The quadratic shortest path problem: complexity, approximability, and solution methods

This page was built for publication: Inductive linearization for binary quadratic programs with linear constraints: a computational study

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