Assignment Problems and the Location of Economic Activities

DOI10.2307/1907742zbMath0098.12203OpenAlexW3121235808WikidataQ63285624 ScholiaQ63285624MaRDI QIDQ3277809

T. Koopmans, Martin J. Beckmann

Publication date: 1957

Published in: Econometrica (Search for Journal in Brave)

Full work available at URL: https://cowles.yale.edu/sites/default/files/files/pub/d00/d0004.pdf

zbMATH Keywords

Applications of probability theory and statistics

Related Items (only showing first 100 items - show all)

A multi-parent genetic algorithm for the quadratic assignment problem ⋮ Construction heuristics for the single row layout problem with machine-spanning clearances ⋮ An efficient algorithm for unequal area facilities layout planning with input and output points ⋮ Taking advantage of symmetry in some quadratic assignment problems ⋮ Matching and a technology-induced skewness in income distributions ⋮ The generalised machine layout problem ⋮ The double row layout problem ⋮ Genetic algorithm for linear and cyclic assignment problem ⋮ Ant colony optimization for solving an industrial layout problem ⋮ Complexity and Polynomially Solvable Special Cases of QUBO ⋮ Transfers and exchange-stability in two-sided matching problems ⋮ PARALLEL HYBRID GENETIC ALGORITHMS FOR SOLVING Q3AP ON COMPUTATIONAL GRID ⋮ Envy-free pricing with general supply constraints for unit demand consumers ⋮ LINEAR PROGRAMMING AND RECURRENT ASSOCIATIVE MEMORIES ⋮ The quadratic three-dimensional assignment problem: exact and approximate solution methods ⋮ Linear programming and simple associative memories ⋮ A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives ⋮ Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps ⋮ Formulating and solving sustainable stochastic dynamic facility layout problem: a key to sustainable operations ⋮ The Rank-One Quadratic Assignment Problem ⋮ Stability properties of the core in a generalized assignment problem ⋮ New variable-length data compression scheme for solution representation of meta-heuristics ⋮ Multi- and many-objective path-relinking: a taxonomy and decomposition approach ⋮ Applications of Quadratic Programming ⋮ A weighted perfect matching with constraints on weights of its parts ⋮ Integrating combinatorial algorithms into a linear programming solver ⋮ Two-level modified simulated annealing based approach for solving facility layout problem ⋮ Selection hyper-heuristics for the multi and many-objective quadratic assignment problem ⋮ Inductive linearization for binary quadratic programs with linear constraints ⋮ Gilmore-Lawler bound of quadratic assignment problem ⋮ An efficient heuristic for the \(k\)-partitioning problem ⋮ On Groves mechanisms for costly inclusion ⋮ Partial neighborhood local searches ⋮ A New Neighborhood for the QAP ⋮ Integrating SLP with simulation to design and evaluate facility layout for industrial head lettuce production ⋮ Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple ⋮ Characterizing linearizable QAPs by the level-1 reformulation-linearization technique ⋮ On Integrality in Semidefinite Programming for Discrete Optimization ⋮ gym-flp: a Python package for training reinforcement learning algorithms on facility layout problems ⋮ Garden optimization problems for benchmarking quantum annealers ⋮ The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows ⋮ An integer programming approach to a class of combinatorial problems ⋮ On the application of deterministic and stochastic programming methods to problems of economics;Mathematische Programmierung und ihre Anwendung auf die Wirtschaft ⋮ IMPROVED PROJECTION HOPFIELD NETWORK FOR THE QUADRATIC ASSIGNMENT PROBLEM ⋮ Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme ⋮ A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique ⋮ Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study ⋮ Local Search Algorithms for the Maximal Planar Layout Problem ⋮ A graph theoretic approach to markets for indivisible goods ⋮ Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters ⋮ Toward a land use planning model for new towns† ⋮ Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem ⋮ Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-Monge matrices ⋮ An experimental study of variable depth search algorithms for the quadratic assignment problem ⋮ Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique ⋮ A hybrid ant colony optimization algorithm for solving facility layout problems formulated as quadratic assignment problems ⋮ Maximizing Polynomials Subject to Assignment Constraints ⋮ The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases ⋮ Problema de asignacion cuadratica multiobjetivo ⋮ Compact linearization for binary quadratic problems ⋮ Improved tabu search heuristics for the dynamic space allocation problem ⋮ A TISSUE P SYSTEM BASED SOLUTION TO QUADRATIC ASSIGNMENT PROBLEM ⋮ Probabilistic stopping rules for GRASP heuristics and extensions ⋮ A genetic algorithm for facility layout ⋮ A New Tractable Case of the QAP with a Robinson Matrix ⋮ Auction protocols for decentralized scheduling ⋮ The QAP-polytope and the star transformation ⋮ On the landscape ruggedness of the quadratic assignment problem ⋮ Descending price multi-item auctions ⋮ Competitive equilibria in economies with multiple indivisible and multiple divisible commodities ⋮ Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability ⋮ An ejection chain algorithm for the quadratic assignment problem ⋮ Cotas inferiores para el QAP-Arbol ⋮ A local genetic approach to multi-objective, facility layout problems with fixed aisles ⋮ A hybrid metaheuristic for the quadratic assignment problem ⋮ Finding a cluster of points and the grey pattern quadratic assignment problem ⋮ A contribution to quadratic assignment problems ⋮ An interactive multiobjective programming approach to combinatorial data analysis ⋮ Global Approaches for Facility Layout and VLSI Floorplanning ⋮ Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting ⋮ A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices ⋮ Computing the nucleolus of weighted cooperative matching games in polynomial time ⋮ GRASP with Path-Relinking for Facility Layout ⋮ Unnamed Item ⋮ The Stable Fixtures Problem with Payments ⋮ $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices ⋮ Forward Backward Transformation ⋮ Unnamed Item ⋮ A tabu search heuristic for the dynamic space allocation problem ⋮ A semidefinite optimization approach for the single-row layout problem with unequal dimensions ⋮ A new linearization method for quadratic assignment problems ⋮ The asymptotic probabilistic behaviour of quadratic sum assignment problems ⋮ Exact Solution of Two Location Problems via Branch-and-Bound ⋮ Optimal Mass Transport for Activities Location Problem ⋮ A unified approach to simple special cases of extremal permutation problems ⋮ Decentralized Matching Markets of Various Sizes: Similarly Stable Solutions with High Proportions of Equal Splits ⋮ An improved tabu search heuristic for solving facility layout design problems ⋮ Well-solvable cases of the QAP with block-structured matrices ⋮ The minimum flow cost Hamiltonian cycle problem: a comparison of formulations ⋮ Linearizable special cases of the QAP

This page was built for publication: Assignment Problems and the Location of Economic Activities