scientific article; zbMATH DE number 714527
From MaRDI portal
Publication:4321548
zbMath0819.90049MaRDI QIDQ4321548
Warren P. Adams, Terri A. Johnson
Publication date: 23 January 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Convex programming (90C25) Mixed integer programming (90C11) Quadratic programming (90C20) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (46)
Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems ⋮ Lower bounding procedure for the asymmetric quadratic traveling salesman problem ⋮ A survey for the quadratic assignment problem ⋮ Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs ⋮ A branch-and-cut algorithm for quadratic assignment problems based on linearizations ⋮ A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives ⋮ A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems ⋮ Bounds for the quadratic assignment problem using the bundle method ⋮ A level-2 reformulation-linearization technique bound for the quadratic assignment problem ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers ⋮ Optimal sequences in stochastic single machine shops ⋮ The multi-story space assignment problem ⋮ Integrating combinatorial algorithms into a linear programming solver ⋮ Inductive linearization for binary quadratic programs with linear constraints ⋮ Characterizing linearizable QAPs by the level-1 reformulation-linearization technique ⋮ Sinkhorn Algorithm for Lifted Assignment Problems ⋮ An LP-based characterization of solvable QAP instances with chess-board and graded structures ⋮ The ‘Idiot’ crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems ⋮ Quadratic Combinatorial Optimization Using Separable Underestimators ⋮ Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters ⋮ Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations ⋮ Natalie 2.0: sparse global network alignment as a special case of quadratic assignment ⋮ Exact solution of emerging quadratic assignment problems ⋮ Constrained 0-1 quadratic programming: basic approaches and extensions ⋮ Maximizing Polynomials Subject to Assignment Constraints ⋮ An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations ⋮ New linearizations of quadratic assignment problems ⋮ Best reduction of the quadratic semi-assignment problem ⋮ RLT insights into lift-and-project closures ⋮ Selected topics on assignment problems ⋮ The QAP-polytope and the star transformation ⋮ Effective formulation reductions for the quadratic assignment problem ⋮ A new relaxation framework for quadratic assignment problems based on matrix splitting ⋮ Inductive linearization for binary quadratic programs with linear constraints: a computational study ⋮ Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting ⋮ A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices ⋮ Image matching from handcrafted to deep features: a survey ⋮ The linearization problem of a binary quadratic problem and its applications ⋮ Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem ⋮ Lower bounds for nonlinear assignment problems using many body interactions ⋮ A variant of time minimizing assignment problem ⋮ Linear programming insights into solvable cases of the quadratic assignment problem ⋮ A revised reformulation-linearization technique for the quadratic assignment problem ⋮ Minimum Congestion Mapping in a Cloud ⋮ A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
This page was built for publication:
