The following pages link to (Q3747197):
Displayed 48 items.
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- On the distance spread of cacti and bicyclic graphs (Q277650) (← links)
- How to park freight trains on rail-rail transshipment yards: the train location problem (Q443824) (← links)
- On improving convex quadratic programming relaxation for the quadratic assignment problem (Q498438) (← links)
- Discrete optimization: an Austrian view (Q537581) (← links)
- Global optimization of a class of nonconvex quadratically constrained quadratic programming problems (Q644622) (← links)
- Solving the quadratic assignment problem by the repeated iterated tabu search method (Q681911) (← links)
- A new branch and bound algorithm for cell formation problem (Q693667) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices (Q853797) (← links)
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations (Q856686) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem (Q1130046) (← links)
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem (Q1130079) (← links)
- Lagrangean decomposition for integer nonlinear programming with linear constraints (Q1181738) (← links)
- Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem (Q1184337) (← links)
- Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality (Q1187508) (← links)
- Algorithms for robust single and multiple period layout planning for manufacturing systems (Q1205706) (← links)
- An optimal tree search method for the manufacturing systems cell formation problem (Q1291773) (← links)
- Bounds for the spectrum of normal matrices (Q1329998) (← links)
- Lower bounds for the quadratic assignment problem (Q1339141) (← links)
- Extensions of a tabu search adaptation to the quadratic assignment problem (Q1342101) (← links)
- A new exact algorithm for the solution of quadratic assignment problems (Q1343146) (← links)
- Lower bounds for the spread of a Hermitian matrix (Q1355235) (← links)
- A classification of formulations for the (time-dependent) traveling salesman problem (Q1388929) (← links)
- A minimax assignment problem in treelike communication networks (Q1390338) (← links)
- A novel chaotic search for quadratic assignment problems (Q1598725) (← links)
- On least distance eigenvalue of uniform hypergraphs (Q1722033) (← links)
- A performance guarantee heuristic for electronic components placement problems including thermal effects (Q1781568) (← links)
- A note on lack of strong duality for quadratic problems with orthogonal constraints (Q1848387) (← links)
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- Convex graph invariant relaxations for graph edit distance (Q2118089) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- Diffusion bank networks and capital flows (Q2230764) (← links)
- Note on the spread of real symmetric matrices with entries in fixed interval (Q2244879) (← links)
- On adjacency-distance spectral radius and spread of graphs (Q2287559) (← links)
- Continuous relaxations for the traveling salesman problem (Q2296989) (← links)
- A user's guide to tabu search (Q2366991) (← links)
- Minimum energy configurations on a toric lattice as a quadratic assignment problem (Q2673239) (← links)
- $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices (Q2832890) (← links)
- Quadratic assignment problems on series-parallel digraphs (Q3730344) (← links)
- Matrix differential equations: a continuous realization process for linear algebra problems (Q4030882) (← links)
- Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation (Q4609470) (← links)
- Eigenanalysis-based task mapping on parallel computers with cellular networks (Q5418487) (← links)
- The eccentricity spread of weak-friendship graphs (Q6063841) (← links)
- Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis (Q6072326) (← links)