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

Linearizable special cases of the QAP, A unified FFT-based approach to maximum assignment problems related to transitive finite group actions, The economics of platforms in a Walrasian framework, A hybrid biased random key genetic algorithm for the quadratic assignment problem, Large-scale layout of facilities using a heuristic hybrid algorithm, Copositive and semidefinite relaxations of the quadratic assignment problem, Lower bounds for the quadratic assignment problem, The facility layout problem, An experimental examination into the design of decentralized methods to solve the assignment problem with and without money, Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem, Random decentralized market processes for stable job matchings with competitive salaries, Existence, uniqueness and efficiency of equilibrium in hedonic markets with multidimensional types, The bipartite quadratic assignment problem and extensions, A survey for the quadratic assignment problem, Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices, A branch-and-cut algorithm for quadratic assignment problems based on linearizations, Entry and structures of interest groups in assignment games, A heuristic method for the multi-story layout problem, A nonmonotone GRASP, Optimization of the quadratic assignment problem using an ant colony algorithm, A note on a polynomial time solvable case of the quadratic assignment problem, A new mixed integer programming formulation for facility layout design using flexible bays, Quadratic assignment problems, Resource assignment with preference conditions, Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers, On the unboundedness of facility layout problems, A glimpse into the differential topology and geometry of optimal transport, Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem, A parallel depth first search branch and bound algorithm for the quadratic assignment problem, The multi-story space assignment problem, Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem, Finding linear and circular sequences of minimal and maximal total adjacency, An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems, Contributions to the quadratic assignment problem, A semidefinite optimization approach to the target visitation problem, Polynomially solvable special cases of the quadratic bottleneck assignment problem, A branch-and-bound algorithm for the single-row equidistant facility layout problem, Global optimality conditions and optimization methods for quadratic assignment problems, Heuristics and their design: A survey, A survey on assignment markets, 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, A heuristic procedure for solving the quadratic assignment problem, An implementation of the iterated tabu search algorithm for the quadratic assignment problem, Moment inequalities for sums of random matrices and their applications in optimization, Task assignment with controlled and autonomous agents, On the quadratic assignment problem, Biological computation of the solution to the quadratic assignment problem, The random quadratic assignment problem, The Wiener maximum quadratic assignment problem, Two classes of quadratic assignment problems that are solvable as linear assignment problems, The core of some location games, Exact algorithms for the solution of the grey pattern quadratic assignment problem, Split sizes and extremal tree shapes, An efficient multi-item dynamic auction with budget constrained bidders, Elitist matching and skewness in income distributions, How to efficiently allocate houses under price controls?, Experimental analysis of crossover and mutation operators on the quadratic assignment problem, Solving the quadratic assignment problem by the repeated iterated tabu search method, Random assignment problems, Recent models and techniques for solving the layout problem, Flow network design for manufacturing systems layout, Experimental analysis of simulated annealing based algorithms for the layout problem, Simulated annealing for machine layout problems in the presence of zoning constraints, A multiattribute decision-theoretic approach for the layout design problem, A distance assignment approach to the facility layout problem, Efficient stabilization of cooperative matching games, Generating quadratic assignment test problems with known optimal permutations, Repulsive assignment problem, An interactive layout heuristic based on hexagonal adjacency graphs, Selected topics on assignment problems, Routing traffic at hub facilities, A model of partnership formation, Effective formulation reductions for the quadratic assignment problem, An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages, Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique, A new relaxation framework for quadratic assignment problems based on matrix splitting, Simplified mechanisms with an application to sponsored-search auctions, An algorithm for the quadratic assignment problem using Benders' decomposition, Some numerical considerations of optimal allocation with gravity flow costs, A hyperbolic smoothing approach to the multisource Weber problem, Continuity and uniqueness in revealed preference, Solving the failure-to-fit problem for plant layout: By changing department shapes and sizes, A neural network approach to facility layout problems, A solvable case of the quadratic assignment problem, Optimizing simulated annealing schedules with genetic programming, Competitive equilibrium with indivisibilities, A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem, The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases, Lower bounds for nonlinear assignment problems using many body interactions, One-dimensional machine location problems in a multi-product flowline with equidistant locations, A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method, On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem, A variant of time minimizing assignment problem, Walrasian equilibrium with gross substitutes, Efficient models for the facility layout problem, QAPLIB-A quadratic assignment problem library, An exact algorithm for the general quadratic assignment problem, Probabilistic asymptotic properties of some combinatorial optimization problems, A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system, Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods, 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, Fairer comparisons for travelling salesman problem solutions using hash functions, The repeated p-dispersion problem, One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations, An LP-based characterization of solvable QAP instances with chess-board and graded structures, Sensitivity of fair prices in assignment markets, An extreme point algorithm for a local minimum solution to the quadratic assignment problem, A study of diversification strategies for the quadratic assignment problem, A genetic approach to the quadratic assignment problem, A new exact algorithm for the solution of quadratic assignment problems, Optimal facility layout and material handling network design, Solving multi objective facility layout problem by modified simulated annealing, Statistical shape analysis of brain arterial networks (BAN), The stable fixtures problem with payments, Strategy-proofness of worker-optimal matching with continuously transferable utility, A Lagrangian relaxation algorithm for sparse quadratic assignment problems, A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation, Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments, Tabu search and iterated local search for the cyclic bottleneck assignment problem, Integer programming models and linearizations for the traveling car renter problem, A modification of threshold accepting and its application to the quadratic assignment problem, Competitive equilibrium in an exchange economy with indivisibilities, A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems, Fast simulated annealing for single-row equidistant facility layout, Location and layout planning. A survey, Solution methods for the balancing of jet turbines, A methodology to exploit profit allocation in logistics joint distribution network optimization, A landscape-based analysis of fixed temperature and simulated annealing, Assortative matching with network spillovers, Inefficient sorting under output sharing, Pre-matching gambles, Optimal sequences in stochastic single machine shops, The quadratic cycle cover problem: special cases and efficient bounds, Biologically inspired parent selection in genetic algorithms, On the quality of local search for the quadratic assignment problem, A new exact discrete linear reformulation of the quadratic assignment problem, A \(\beta\)-accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics, A heuristic procedure for the single-row facility layout problem, Locating names on vertices of a transaction network, A new greedy algorithm for the quadratic assignment problem, The multi-stripe travelling salesman problem, Hope: A genetic algorithm for the unequal area facility layout problem., Comparative statics in markets for indivisible goods, FACOPT: A user friendly FACility layout OPTimization system., A linear assignment approach for the least-squares protein morphing problem, Solving the quadratic assignment problem, Revisiting simulated annealing: a component-based analysis, An improved genetic algorithm based robust approach for stochastic dynamic facility layout problem, The empirical content of marital surplus in matching models, Integrating big data analytic and hybrid firefly-chaotic simulated annealing approach for facility layout problem, ADMM for the SDP relaxation of the QAP, Critical objective function values in linear sum assignment problems, Does it make sense to analyse a two-sided market as a multi-choice game?, An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations, Layout optimisation for an installation port of an offshore wind farm, Matching with peer monitoring, The importance of memory for price discovery in decentralized markets, Dual bounds of a service level assignment problem with applications to efficient pricing, New special cases of the quadratic assignment problem with diagonally structured coefficient matrices, Two-sided allocation problems, decomposability, and the impossibility of efficient trade, Another well-solvable case of the QAP: maximizing the job completion time variance, Embedding signed graphs in the line, Multi-level departments-to-offices assignment with different room types, New linearizations of quadratic assignment problems, RLT insights into lift-and-project closures, The dynamic space allocation problem: applying hybrid GRASP and tabu search metaheuristics, Convergence of the surrogate Lagrangian relaxation method, Dynamic programming for the quadratic assignment problem on trees, Extensions to STaTS for practical applications of the facility layout problem, A competitive partnership formation process, Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem, A performance guarantee heuristic for electronic components placement problems including thermal effects, Optimal test allocation, Efficiency, stability, and commitment in senior level job matching markets, A parallel heuristic for quadratic assignment problems, The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure, Random walk's correlation function for multi-objective NK landscapes and quadratic assignment problem, A proximal DC approach for quadratic assignment problem, Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search, Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems, Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\), On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem, A new algorithm for solving a special matching problem with a general form value function under constraints, Costly information acquisition, Continuous relaxations for the traveling salesman problem, A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem, Equilibrium in an exchange economy with multiple indivisible commodities and money, The linearization problem of a binary quadratic problem and its applications, Matching markets and cultural selection, Sampled Gromov Wasserstein, A marriage matching function with flexible spillover and substitution patterns, The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics, Hybrid algorithms for placement of virtual machines across geo-separated data centers, Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach, A time-triggered dimension reduction algorithm for the task assignment problem, Linear programming insights into solvable cases of the quadratic assignment problem, A revised reformulation-linearization technique for the quadratic assignment problem, SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs, A competitive market model for indivisible commodities., Bipartite choices, Who should get vaccinated? Individualized allocation of vaccines over SIR network, Existence and welfare properties of equilibrium in an exchange economy with multiple divisible and indivisible commodities and linear production technologies, The package assignment model., Exact SDP relaxations of quadratically constrained quadratic programs with forest structures, Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation, An improved genetic algorithm for facility layout problems having inner structure walls and passages