Pages that link to "Item:Q1173009"
From MaRDI portal
The following pages link to On the quadratic assignment problem (Q1173009):
Displayed 45 items.
- A new mixed integer programming model for curriculum balancing: application to a Turkish university (Q296758) (← links)
- Quadratic assignment problems (Q594767) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- GRASP with path-relinking for the generalized quadratic assignment problem (Q763245) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- The service allocation problem at the Gioia Tauro maritime terminal (Q852990) (← links)
- Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
- The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm (Q976040) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- On lower bounds for a class of quadratic 0,1 programs (Q1072937) (← links)
- The facility layout problem (Q1088577) (← links)
- Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality (Q1187508) (← links)
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems (Q1278346) (← links)
- Lower bounds for nonlinear assignment problems using many body interactions (Q1291723) (← links)
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method (Q1296800) (← links)
- A variant of time minimizing assignment problem (Q1303581) (← links)
- Lower bounds for the quadratic assignment problem (Q1339141) (← links)
- Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays (Q1631647) (← links)
- Compact linearization for binary quadratic problems subject to assignment constraints (Q1728408) (← 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)
- A performance guarantee heuristic for electronic components placement problems including thermal effects (Q1781568) (← links)
- Optimal sequences in stochastic single machine shops (Q1919778) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
- RLT insights into lift-and-project closures (Q2257076) (← links)
- A priority based unbalanced time minimization assignment problem (Q2307977) (← links)
- Hybrid algorithms for placement of virtual machines across geo-separated data centers (Q2331587) (← 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)
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064) (← links)
- Compact linearization for binary quadratic problems (Q2477615) (← links)
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
- Evaluating the quality of image matrices in blockmodeling (Q2516355) (← links)
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833) (← links)
- A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases (Q2835697) (← links)
- A contribution to quadratic assignment problems (Q3362092) (← links)
- A new linearization method for quadratic assignment problems (Q3423596) (← links)
- On the Quadratic Programming Approach for Hub Location Problems (Q3638504) (← links)
- On linear programs with random costs (Q3724096) (← links)
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters (Q5139631) (← links)
- Best reduction of the quadratic semi-assignment problem (Q5931788) (← links)
- Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
- Sinkhorn Algorithm for Lifted Assignment Problems (Q6133998) (← links)