The following pages link to (Q4321548):
Displaying 50 items.
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers (Q367651) (← links)
- The multi-story space assignment problem (Q610966) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations (Q856686) (← links)
- Bounds for the quadratic assignment problem using the bundle method (Q868474) (← links)
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
- Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
- A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
- Lower bounds for nonlinear assignment problems using many body interactions (Q1291723) (← links)
- A variant of time minimizing assignment problem (Q1303581) (← links)
- Lower bounds for the quadratic assignment problem (Q1339141) (← links)
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems (Q1662098) (← links)
- Natalie 2.0: sparse global network alignment as a special case of quadratic assignment (Q1736730) (← links)
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
- New linearizations of quadratic assignment problems (Q1761235) (← links)
- Lower bounds based on linear programming for the quadratic assignment problem (Q1804578) (← links)
- Optimal sequences in stochastic single machine shops (Q1919778) (← links)
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations (Q1975377) (← links)
- Image matching from handcrafted to deep features: a survey (Q2056423) (← links)
- The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
- RLT insights into lift-and-project closures (Q2257076) (← links)
- Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
- A revised reformulation-linearization technique for the quadratic assignment problem (Q2339837) (← links)
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196) (← links)
- Integrating combinatorial algorithms into a linear programming solver (Q2418164) (← links)
- Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
- Lower bound improvement and forcing rule for quadratic binary programming (Q2506180) (← 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)
- Exact solution of emerging quadratic assignment problems (Q3002542) (← links)
- Maximizing Polynomials Subject to Assignment Constraints (Q3012829) (← links)
- Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
- A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives (Q3466781) (← links)
- The ‘Idiot’ crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems (Q5113712) (← links)
- Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters (Q5139631) (← links)
- Minimum Congestion Mapping in a Cloud (Q5258917) (← links)
- (Q5688490) (← links)
- A new bound for the quadratic assignment problem based on convex quadratic programming (Q5930731) (← links)
- Best reduction of the quadratic semi-assignment problem (Q5931788) (← links)
- The QAP-polytope and the star transformation (Q5939231) (← links)
- Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique (Q6122081) (← links)
- Sinkhorn Algorithm for Lifted Assignment Problems (Q6133998) (← links)
- An LP-based characterization of solvable QAP instances with chess-board and graded structures (Q6168180) (← links)
