Assignment Problems and the Location of Economic Activities
From MaRDI portal
Publication:3277809
DOI10.2307/1907742zbMATH Open0098.12203OpenAlexW3121235808WikidataQ63285624 ScholiaQ63285624MaRDI QIDQ3277809FDOQ3277809
Authors: 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
Cited In (only showing first 100 items - show all)
- A new exact algorithm for the solution of quadratic assignment problems
- A unified FFT-based approach to maximum assignment problems related to transitive finite group actions
- The economics of platforms in a Walrasian framework
- The asymptotic probabilistic behaviour of quadratic sum assignment problems
- A new exact discrete linear reformulation of the quadratic assignment problem
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- A new greedy algorithm for the quadratic assignment problem
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- The QAP-polytope and the star transformation
- Layout optimisation for an installation port of an offshore wind farm
- New linearizations of quadratic assignment problems
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
- An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages
- Solving multi objective facility layout problem by modified simulated annealing
- The stable fixtures problem with payments
- A competitive partnership formation process
- An interactive layout heuristic based on hexagonal adjacency graphs
- Linear programming insights into solvable cases of the quadratic assignment problem
- Flow network design for manufacturing systems layout
- A neural network approach to facility layout problems
- Lower bounds for nonlinear assignment problems using many body interactions
- Large-scale layout of facilities using a heuristic hybrid algorithm
- Solution methods for the balancing of jet turbines
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
- Optimal test allocation
- A semidefinite optimization approach to the target visitation problem
- A hyperbolic smoothing approach to the multisource Weber problem
- Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach
- Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique
- A modification of threshold accepting and its application to the quadratic assignment problem
- Task assignment with controlled and autonomous agents
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices
- A hybrid ant colony optimization algorithm for solving facility layout problems formulated as quadratic assignment problems
- Resource assignment with preference conditions
- An experimental examination into the design of decentralized methods to solve the assignment problem with and without money
- Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\)
- A heuristic method for the multi-story layout problem
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
- Optimal sequences in stochastic single machine shops
- A weighted perfect matching with constraints on weights of its parts
- Extensions to STaTS for practical applications of the facility layout problem
- Computing the nucleolus of weighted cooperative matching games in polynomial time
- Exact algorithms for the solution of the grey pattern quadratic assignment problem
- An efficient multi-item dynamic auction with budget constrained bidders
- An integer programming approach to a class of combinatorial problems
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- The core of some location games
- A Lagrangian relaxation algorithm for sparse quadratic assignment problems
- The random quadratic assignment problem
- Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study
- On the quality of local search for the quadratic assignment problem
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem
- An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems
- Contributions to the quadratic assignment problem
- Heuristics and their design: A survey
- A heuristic procedure for solving the quadratic assignment problem
- Split sizes and extremal tree shapes
- Auction protocols for decentralized scheduling
- An exact algorithm for the general quadratic assignment problem
- An interactive multiobjective programming approach to combinatorial data analysis
- Costly information acquisition
- Competitive equilibrium with indivisibilities
- Lower bounds for the quadratic assignment problem
- Solving the quadratic assignment problem by the repeated iterated tabu search method
- Efficient stabilization of cooperative matching games
- Matching markets and cultural selection
- Sampled Gromov Wasserstein
- Maximizing Polynomials Subject to Assignment Constraints
- On complexity classes of envy-free pricing problems: a short survey
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
- The multi-stripe travelling salesman problem
- The quadratic cycle cover problem: special cases and efficient bounds
- A linear assignment approach for the least-squares protein morphing problem
- Inductive linearization for binary quadratic programs with linear constraints
- Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple
- A genetic algorithm for facility layout
- Reversible Gromov-Monge sampler for simulation-based inference
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
- One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations
- LINEAR PROGRAMMING AND RECURRENT ASSOCIATIVE MEMORIES
- A time-triggered dimension reduction algorithm for the task assignment problem
- On Integrality in Semidefinite Programming for Discrete Optimization
- gym-flp: a Python package for training reinforcement learning algorithms on facility layout problems
- Probabilistic stopping rules for GRASP heuristics and extensions
- Stability properties of the core in a generalized assignment problem
- Does it make sense to analyse a two-sided market as a multi-choice game?
- The repeated p-dispersion problem
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
- Exact solution of two location problems via branch-and-bound
- An improved genetic algorithm based robust approach for stochastic dynamic facility layout problem
- Who should get vaccinated? Individualized allocation of vaccines over SIR network
- Solving the quadratic assignment problem
- The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics
- Embedding signed graphs in the line
- Matching with peer monitoring
- The importance of memory for price discovery in decentralized markets
This page was built for publication: Assignment Problems and the Location of Economic Activities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3277809)