Pages that link to "Item:Q3962772"
From MaRDI portal
The following pages link to On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem (Q3962772):
Displayed 18 items.
- Global optimality conditions and optimization methods for quadratic assignment problems (Q422852) (← links)
- Continuation methods for approximate large scale object sequencing (Q669313) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- The facility layout problem (Q1088577) (← links)
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency (Q1194735) (← links)
- Generating quadratic assignment test problems with known optimal permutations (Q1203071) (← links)
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem (Q1278325) (← links)
- Lower bounds for nonlinear assignment problems using many body interactions (Q1291723) (← links)
- A variant of time minimizing assignment problem (Q1303581) (← links)
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem (Q1821011) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- An algebra-based approach for linearly constrained concave minimization (Q1876470) (← links)
- An extreme point algorithm for a local minimum solution to the quadratic assignment problem (Q1877896) (← links)
- A new necessary and sufficient global optimality condition for canonical DC problems (Q1945515) (← links)
- On cutting planes for cardinality-constrained linear programs (Q2330656) (← links)
- $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices (Q2832890) (← links)
- Global minimization of large-scale constrained concave quadratic problems by separable programming (Q3731373) (← links)
- A branch and bound method for solving the bidirectional circular layout problem (Q5961820) (← links)