Pages that link to "Item:Q868474"

The following pages link to Bounds for the quadratic assignment problem using the bundle method (Q868474):

Displaying 29 items.

• Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
• Knapsack problem with probability constraints (Q628737) (← links)
• Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180) (← links)
• Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) (← links)
• A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
• An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
• ADMM for the SDP relaxation of the QAP (Q1741118) (← links)
• Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
• A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
• Product assortment and space allocation strategies to attract loyal and non-loyal customers (Q2184066) (← links)
• A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
• Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
• Dynamic bundle methods (Q2390994) (← links)
• Local minima and convergence in low-rank semidefinite programming (Q2487849) (← links)
• Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
• A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
• Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
• SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
• A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem (Q2815440) (← links)
• Exact Solution Methods for the k-Item Quadratic Knapsack Problem (Q2835673) (← links)
• Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
• An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
• Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
• A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP (Q5106411) (← links)
• Exact Solution of Two Location Problems via Branch-and-Bound (Q5506728) (← links)
• Taking advantage of symmetry in some quadratic assignment problems (Q5884391) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
• Sinkhorn Algorithm for Lifted Assignment Problems (Q6133998) (← links)