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)
- RLT insights into lift-and-project closures
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Linearizable special cases of the QAP
- Integrating combinatorial algorithms into a linear programming solver
- An ejection chain algorithm for the quadratic assignment problem
- Two classes of quadratic assignment problems that are solvable as linear assignment problems
- Selected topics on assignment problems
- Copositive and semidefinite relaxations of the quadratic assignment problem
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- The double row layout problem
- A hybrid biased random key genetic algorithm for the quadratic assignment problem
- Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices
- Routing traffic at hub facilities
- Comparative statics in markets for indivisible goods
- Global optimality conditions and optimization methods for quadratic assignment problems
- On the landscape ruggedness of the quadratic assignment problem
- How to efficiently allocate houses under price controls?
- Competitive equilibrium in an exchange economy with indivisibilities
- Existence, uniqueness and efficiency of equilibrium in hedonic markets with multidimensional types
- On the unboundedness of facility layout problems
- A solvable case of the quadratic assignment problem
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
- Walrasian equilibrium with gross substitutes
- Simplified mechanisms with an application to sponsored-search auctions
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Optimization of the quadratic assignment problem using an ant colony algorithm
- A survey for the quadratic assignment problem
- Biological computation of the solution to the quadratic assignment problem
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
- One-dimensional machine location problems in a multi-product flowline with equidistant locations
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem
- The Wiener maximum quadratic assignment problem
- Random decentralized market processes for stable job matchings with competitive salaries
- Another well-solvable case of the QAP: maximizing the job completion time variance
- Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
- The multi-story space assignment problem
- A variant of time minimizing assignment problem
- Entry and structures of interest groups in assignment games
- A branch-and-bound algorithm for the single-row equidistant facility layout problem
- Random assignment problems
- An improved genetic algorithm for 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 linearization method for quadratic assignment problems
- The bipartite quadratic assignment problem and extensions
- On the quadratic assignment problem
- A graph theoretic approach to markets for indivisible goods
- An extreme point algorithm for a local minimum solution to the quadratic assignment problem
- Optimizing simulated annealing schedules with genetic programming
- Efficient models for the facility layout problem
- Location and layout planning. A survey
- A new mixed integer programming formulation for facility layout design using flexible bays
- The facility layout problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- Recent models and techniques for solving the layout problem
- Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
- A nonmonotone GRASP
- Finding a cluster of points and the grey pattern quadratic assignment problem
- Probabilistic asymptotic properties of some combinatorial optimization problems
- QAPLIB-A quadratic assignment problem library
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
- Moment inequalities for sums of random matrices and their applications in optimization
- Fast simulated annealing for single-row equidistant facility layout
- A contribution to quadratic assignment problems
- Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
- Global approaches for facility layout and VLSI floorplanning
- A genetic approach to the quadratic assignment problem
- A study of diversification strategies for the quadratic assignment problem
- A heuristic procedure for the single-row facility layout problem
- Hope: A genetic algorithm for the unequal area facility layout problem.
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- Improved tabu search heuristics for the dynamic space allocation problem
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
- Generating quadratic assignment test problems with known optimal permutations
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
- A hybrid metaheuristic for the quadratic assignment problem
- Convergence of the surrogate Lagrangian relaxation method
- A glimpse into the differential topology and geometry of optimal transport
- The package assignment model.
- Optimal facility layout and material handling network design
- ADMM for the SDP relaxation of the QAP
- Quadratic assignment problems
- Dynamic programming for the quadratic assignment problem on trees
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- A new relaxation framework for quadratic assignment problems based on matrix splitting
- Effective formulation reductions for the quadratic assignment problem
- A revised reformulation-linearization technique for the quadratic assignment problem
- Ant colony optimization for solving an industrial layout problem
- A model of partnership formation
- 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
- Descending price multi-item auctions
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- Inductive linearization for binary quadratic programs with linear constraints
- A competitive market model for indivisible commodities.
- A multi-parent genetic algorithm for the quadratic assignment problem
- One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations
- LINEAR PROGRAMMING AND RECURRENT ASSOCIATIVE MEMORIES
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)