Assignment Problems and the Location of Economic Activities
From MaRDI portal
Publication:3277809
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
- Stability properties of the core in a generalized assignment problem
- An algorithm for the quadratic assignment problem using Benders' decomposition
- RLT insights into lift-and-project closures
- Does it make sense to analyse a two-sided market as a multi-choice game?
- Probabilistic stopping rules for GRASP heuristics and extensions
- On Integrality in Semidefinite Programming for Discrete Optimization
- gym-flp: a Python package for training reinforcement learning algorithms on facility layout problems
- The Rank-One Quadratic Assignment Problem
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
- The repeated p-dispersion problem
- An improved genetic algorithm based robust approach for stochastic dynamic facility layout problem
- Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme
- A new exact discrete linear reformulation of the quadratic assignment problem
- Linearizable special cases of the QAP
- The asymptotic probabilistic behaviour of quadratic sum assignment problems
- Repulsive assignment problem
- Who should get vaccinated? Individualized allocation of vaccines over SIR network
- Exact solution of two location problems via branch-and-bound
- 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
- Some numerical considerations of optimal allocation with gravity flow costs
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- Integrating big data analytic and hybrid firefly-chaotic simulated annealing approach for facility layout problem
- The empirical content of marital surplus in matching models
- Integrating combinatorial algorithms into a linear programming solver
- An ejection chain algorithm for the quadratic assignment problem
- A survey on performance analysis of warehouse carousel systems
- A new greedy algorithm for the quadratic assignment problem
- The linearization problem of a binary quadratic problem and its applications
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- Layout optimisation for an installation port of an offshore wind farm
- New linearizations of quadratic assignment problems
- Two classes of quadratic assignment problems that are solvable as linear assignment problems
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
- Selected topics on assignment problems
- The QAP-polytope and the star transformation
- Multi-level departments-to-offices assignment with different room types
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
- Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability
- An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages
- Parallel hybrid genetic algorithms for solving Q3AP on computational grid
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Fairer comparisons for travelling salesman problem solutions using hash functions
- A hybrid biased random key genetic algorithm for the quadratic assignment problem
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- Solving the failure-to-fit problem for plant layout: By changing department shapes and sizes
- Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices
- The double row layout problem
- Critical objective function values in linear sum assignment problems
- Solving multi objective facility layout problem by modified simulated annealing
- Simulated annealing for machine layout problems in the presence of zoning constraints
- Routing traffic at hub facilities
- Global optimality conditions and optimization methods for quadratic assignment problems
- Comparative statics in markets for indivisible goods
- A tissue P system based solution to quadratic assignment problem
- Different formulations of the gray pattern problem and their optimal solutions
- The stable fixtures problem with payments
- Revisiting simulated annealing: a component-based analysis
- A note on a polynomial time solvable case of the quadratic assignment problem
- How to efficiently allocate houses under price controls?
- A competitive partnership formation process
- Existence, uniqueness and efficiency of equilibrium in hedonic markets with multidimensional types
- Competitive equilibrium in an exchange economy with indivisibilities
- Selection hyper-heuristics for the multi and many-objective quadratic assignment problem
- On the unboundedness of facility layout problems
- FACOPT: A user friendly FACility layout OPTimization system.
- A solvable case of the quadratic assignment problem
- Local Search Algorithms for the Maximal Planar Layout Problem
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
- On the landscape ruggedness of the quadratic assignment problem
- Walrasian equilibrium with gross substitutes
- A local genetic approach to multi-objective, facility layout problems with fixed aisles
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices
- An interactive layout heuristic based on hexagonal adjacency graphs
- Simplified mechanisms with an application to sponsored-search auctions
- The dynamic space allocation problem: applying hybrid GRASP and tabu search metaheuristics
- Linear programming insights into solvable cases of the quadratic assignment problem
- Lightning graph matching
- Flow network design for manufacturing systems layout
- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Continuous relaxations for the traveling salesman problem
- A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation
- Optimization of the quadratic assignment problem using an ant colony algorithm
- A survey for the quadratic assignment problem
- A neural network approach to facility layout problems
- Lower bounds for nonlinear assignment problems using many body interactions
- A new tractable case of the QAP with a Robinson matrix
- Efficiency, stability, and commitment in senior level job matching markets
- Two-sided allocation problems, decomposability, and the impossibility of efficient trade
- Biological computation of the solution to the quadratic assignment problem
- An efficient heuristic for the \(k\)-partitioning problem
- Large-scale layout of facilities using a heuristic hybrid algorithm
- Hybrid algorithms for placement of virtual machines across geo-separated data centers
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)