Pages that link to "Item:Q3277809"
From MaRDI portal
The following pages link to Assignment Problems and the Location of Economic Activities (Q3277809):
Displayed 50 items.
- 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)
- Why do stable clearinghouses work so well? -- Small sets of stable matchings in typical environments, and the limits-on-manipulation theorem of Demange, Gale and Sotomayor (Q908186) (← links)
- Biological computation of the solution to the quadratic assignment problem (Q929455) (← links)
- Random assignment problems (Q953417) (← links)
- Repulsive assignment problem (Q963661) (← links)
- Routing traffic at hub facilities (Q972437) (← links)
- Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
- A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
- Simplified mechanisms with an application to sponsored-search auctions (Q993785) (← links)
- An exact algorithm for the general quadratic assignment problem (Q1067975) (← links)
- Probabilistic asymptotic properties of some combinatorial optimization problems (Q1067976) (← links)
- The facility layout problem (Q1088577) (← links)
- Entry and structures of interest groups in assignment games (Q1106743) (← links)
- A heuristic method for the multi-story layout problem (Q1107411) (← 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)
- Finding linear and circular sequences of minimal and maximal total adjacency (Q1137873) (← links)