Pages that link to "Item:Q3277809"

The following pages link to Assignment Problems and the Location of Economic Activities (Q3277809):

Displaying 50 items.

• Linearizable special cases of the QAP (Q266060) (← links)
• A hybrid biased random key genetic algorithm for the quadratic assignment problem (Q280940) (← links)
• Random decentralized market processes for stable job matchings with competitive salaries (Q308603) (← links)
• The bipartite quadratic assignment problem and extensions (Q322542) (← links)
• A nonmonotone GRASP (Q340011) (← links)
• Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers (Q367651) (← links)
• A glimpse into the differential topology and geometry of optimal transport (Q379832) (← links)
• Polynomially solvable special cases of the quadratic bottleneck assignment problem (Q411238) (← links)
• A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088) (← links)
• Global optimality conditions and optimization methods for quadratic assignment problems (Q422852) (← links)
• An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) (← links)
• Task assignment with controlled and autonomous agents (Q459176) (← links)
• Exact algorithms for the solution of the grey pattern quadratic assignment problem (Q494699) (← links)
• An efficient multi-item dynamic auction with budget constrained bidders (Q495767) (← links)
• How to efficiently allocate houses under price controls? (Q500551) (← links)
• Experimental analysis of crossover and mutation operators on the quadratic assignment problem (Q513133) (← links)
• Efficient stabilization of cooperative matching games (Q526875) (← links)
• A model of partnership formation (Q553531) (← links)
• Quadratic assignment problems (Q594767) (← links)
• On the unboundedness of facility layout problems (Q604804) (← links)
• The multi-story space assignment problem (Q610966) (← links)
• Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem (Q614047) (← links)
• An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems (Q621965) (← links)
• Moment inequalities for sums of random matrices and their applications in optimization (Q647387) (← links)
• The random quadratic assignment problem (Q658428) (← links)
• The Wiener maximum quadratic assignment problem (Q665991) (← links)
• Two classes of quadratic assignment problems that are solvable as linear assignment problems (Q665995) (← links)
• Split sizes and extremal tree shapes (Q670650) (← links)
• Solving the quadratic assignment problem by the repeated iterated tabu search method (Q681911) (← links)
• Selected topics on assignment problems (Q697571) (← links)
• An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages (Q707005) (← links)
• A hyperbolic smoothing approach to the multisource Weber problem (Q740639) (← links)
• On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem (Q793639) (← links)
• Efficient models for the facility layout problem (Q803026) (← links)
• QAPLIB-A quadratic assignment problem library (Q807376) (← links)
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
• A unified FFT-based approach to maximum assignment problems related to transitive finite group actions (Q820943) (← links)
• The economics of platforms in a Walrasian framework (Q825159) (← links)
• Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180) (← links)
• Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem (Q842713) (← links)
• Existence, uniqueness and efficiency of equilibrium in hedonic markets with multidimensional types (Q847814) (← 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)
• Optimization of the quadratic assignment problem using an ant colony algorithm (Q864790) (← links)
• A note on a polynomial time solvable case of the quadratic assignment problem (Q865755) (← links)
• A new mixed integer programming formulation for facility layout design using flexible bays (Q867930) (← links)
• Resource assignment with preference conditions (Q869582) (← links)
• A semidefinite optimization approach to the target visitation problem (Q895779) (← links)
• A survey on assignment markets (Q908179) (← links)