Pages that link to "Item:Q3870675"

The following pages link to Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem (Q3870675):

Displaying 37 items.

• Global optimality conditions and optimization methods for quadratic assignment problems (Q422852) (← links)
• RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
• Quadratic assignment problems (Q594767) (← links)
• Mixed-integer bilinear programming problems (Q687032) (← links)
• Efficient models for the facility layout problem (Q803026) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• An exact algorithm for the general quadratic assignment problem (Q1067975) (← links)
• The facility layout problem (Q1088577) (← links)
• Locational analysis (Q1173002) (← links)
• On the quadratic assignment problem (Q1173009) (← links)
• Single and multiple period layout models for automated manufacturing systems (Q1175306) (← links)
• Simulated annealing for machine layout problems in the presence of zoning constraints (Q1197690) (← links)
• A distance assignment approach to the facility layout problem (Q1197697) (← links)
• A neural network approach to facility layout problems (Q1266731) (← links)
• Optimizing simulated annealing schedules with genetic programming (Q1268274) (← links)
• Network-based formulations of the quadratic assignment problem (Q1291651) (← links)
• Lower bounds for nonlinear assignment problems using many body interactions (Q1291723) (← links)
• A variant of time minimizing assignment problem (Q1303581) (← links)
• A new exact algorithm for the solution of quadratic assignment problems (Q1343146) (← links)
• A heuristic procedure for the single-row facility layout problem (Q1390259) (← links)
• A greedy genetic algorithm for the quadratic assignment problem (Q1577374) (← links)
• Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation (Q1609910) (← links)
• A performance guarantee heuristic for electronic components placement problems including thermal effects (Q1781568) (← links)
• A demand-shifting feasibility algorithm for Benders decomposition. (Q1812005) (← links)
• A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem (Q1821011) (← links)
• A heuristic for quadratic Boolean programs with applications to quadratic assignment problems (Q1838910) (← links)
• Flow distance reduction for a multi-product flowline with sets of identical machines (Q1873007) (← links)
• An extreme point algorithm for a local minimum solution to the quadratic assignment problem (Q1877896) (← links)
• Optimal sequences in stochastic single machine shops (Q1919778) (← links)
• A hybrid heuristic for the facilities layout problem (Q2276871) (← links)
• A Benders decomposition approach to product location in carousel storage systems (Q2288989) (← links)
• Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
• A layout design heuristic employing the theory of fuzzy sets (Q3028685) (← links)
• Mixed-integer quadratic programming (Q3931023) (← links)
• A ‘fuzzy’ heuristic for the quadratic assignment formulation to the facility layout problem (Q4394217) (← links)
• An experimental study of variable depth search algorithms for the quadratic assignment problem (Q4904331) (← links)
• Store-wide space planning balancing Impulse and convenience (Q6069225) (← links)