An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
type: Item
instance of: scholarly article
title: An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
zbMATH Open document ID: 1387.90173
author: Lena Hupp
author: Laura Klein
author: F. Liers
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6872070
zbMATH Keywords: binary quadratic optimisation problem
zbMATH Keywords: reformulation linearisation technique (RLT)
zbMATH Keywords: quadratic matching problem
zbMATH Keywords: polyhedral combinatorics
MaRDI profile type: Publication
full work available at URL: j.disopt.2015.10.002
OpenAlex ID: W2320945305
cites work: Assignment Problems and the Location of Economic Activities
cites work: P-Complete Approximation Problems
cites work: Q3840375
cites work: The quadratic assignment problem
cites work: An algorithm for the quadratic assignment problem using Benders' decomposition
cites work: On the quadratic assignment problem
cites work: Q4026491
cites work: Location, scheduling, design and integer programming
cites work: Q3270229
cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
cites work: Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
cites work: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
cites work: Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
cites work: Constrained 0-1 quadratic programming: basic approaches and extensions
cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
cites work: Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
cites work: Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
cites work: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
cites work: Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
cites work: Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives
cites work: Local cuts revisited
cites work: Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
cites work: Q4397722
cites work: The symmetric quadratic traveling salesman problem
cites work: Combinatorial optimization with one quadratic term: spanning trees and forests
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Q4371290
cites work: Odd Minimum Cut-Sets and b-Matchings
cites work: Odd Minimum Cut Sets and b-Matchings Revisited
cites work: Minimizing submodular functions over families of sets
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization''
cites work: Q4321548
cites work: A level-2 reformulation-linearization technique bound for the quadratic assignment problem
cites work: A semidefinite programming approach to the quadratic knapsack problem
cites work: Benchmarking optimization software with performance profiles.
DOI: 10.1016/J.DISOPT.2015.10.002
Recommended article: An exact algorithm for the general quadratic assignment problem
Recommended article: Exact solution of emerging quadratic assignment problems
Recommended article: A new exact algorithm for the solution of quadratic assignment problems
Recommended article: On the quadratic random matching problem in two-dimensional domains
Recommended article: An Exact Penalty Approach to the Quadratic Assignment Problem
Recommended article: A new form of the quadratic assignment problem and approximate solutions
Recommended article: The exact solution of multiparametric quadratically constrained quadratic programming problems
Recommended article: Q4321559
Recommended article: The quadratic assignment problem. Theory and algorithms
description: scientific article; zbMATH DE number 6872070