Assignment Problems and the Location of Economic Activities
From MaRDI portal
Publication:3277809
Cited in
(only showing first 100 items - show all)- Cotas inferiores para el QAP-Arbol
- On complexity classes of envy-free pricing problems: a short survey
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
- Applications of Quadratic Programming
- An improved tabu search heuristic for solving facility layout design problems
- Simulated annealing for machine layout problems in the presence of zoning constraints
- A new algorithm for solving a special matching problem with a general form value function under constraints
- A time-triggered dimension reduction algorithm for the task 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
- Existence and welfare properties of equilibrium in an exchange economy with multiple divisible and indivisible commodities and linear production technologies
- The Rank-One Quadratic Assignment Problem
- Fairer comparisons for travelling salesman problem solutions using hash functions
- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- Stability properties of the core in a generalized assignment problem
- Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
- A marriage matching function with flexible spillover and substitution patterns
- Equilibrium in an exchange economy with multiple indivisible commodities and money
- A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system
- Solving the failure-to-fit problem for plant layout: By changing department shapes and sizes
- Complexity and polynomially solvable special cases of QUBO
- Linear programming and simple associative memories
- Random walk's correlation function for multi-objective NK landscapes and quadratic assignment problem
- A local genetic approach to multi-objective, facility layout problems with fixed aisles
- scientific article; zbMATH DE number 7306871 (Why is no real title available?)
- High-welfare matching markets via descending price
- Comparing QUBO models for quantum annealing: integer encodings for permutation problems
- A survey on performance analysis of warehouse carousel systems
- Semidefinite programming relaxations of the traveling salesman problem and their integrality gaps
- The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics
- The complexity of matching games: a survey
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
- Embedding signed graphs in the line
- Continuity and uniqueness in revealed preference
- IMPROVED PROJECTION HOPFIELD NETWORK FOR THE QUADRATIC ASSIGNMENT PROBLEM
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- Exact solution of two location problems via branch-and-bound
- Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple
- Forward backward transformation
- Learning to match via inverse optimal transport
- Taking advantage of symmetry in some quadratic assignment problems
- A New Neighborhood for the QAP
- 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
- Competitive equilibria in economies with multiple indivisible and multiple divisible commodities
- Does it make sense to analyse a two-sided market as a multi-choice game?
- A tabu search heuristic for the dynamic space allocation problem
- Parallel hybrid genetic algorithms for solving Q3AP on computational grid
- Biologically inspired parent selection in genetic algorithms
- Descending price multi-item auctions
- A distance assignment approach to the facility layout problem
- A multiattribute decision-theoretic approach for the layout design problem
- Inductive linearization for binary quadratic programs with linear constraints: a computational study
- Sensitivity of fair prices in assignment markets
- A competitive market model for indivisible commodities.
- Different formulations of the gray pattern problem and their optimal solutions
- Matching and a technology-induced skewness in income distributions
- Genetic algorithm for linear and cyclic assignment problem
- Finding linear and circular sequences of minimal and maximal total adjacency
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases
- Elitist matching and skewness in income distributions
- A multi-parent genetic algorithm for the quadratic assignment problem
- Statistical shape analysis of brain arterial networks (BAN)
- The generalised machine layout problem
- A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
- Construction heuristics for the single row layout problem with machine-spanning clearances
- On the application of deterministic and stochastic programming methods to problems of economics;Mathematische Programmierung und ihre Anwendung auf die Wirtschaft
- Decentralized matching markets of various sizes: similarly stable solutions with high proportions of equal splits
- Some numerical considerations of optimal allocation with gravity flow costs
- Gilmore-Lawler bound of quadratic assignment problem
- A genetic algorithm for facility layout
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- Hybrid algorithms for placement of virtual machines across geo-separated data centers
- The quadratic cycle cover problem: special cases and efficient bounds
- Reversible Gromov-Monge sampler for simulation-based inference
- Toward a land use planning model for new towns†
- Optimal mass transport for activities location problem
- A note on a polynomial time solvable case of the quadratic assignment problem
- A tissue P system based solution to quadratic assignment problem
- A landscape-based analysis of fixed temperature and simulated annealing
- On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem
- Inefficient sorting under output sharing
- Pre-matching gambles
- Matching markets and cultural selection
- Where the really hard quadratic assignment problems are: the QAP-SAT instances
- Sampled Gromov Wasserstein
- Maximizing Polynomials Subject to Assignment Constraints
- Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability
- Who should get vaccinated? Individualized allocation of vaccines over SIR network
- On Groves mechanisms for costly inclusion
- Compact linearization for binary quadratic problems
- Partial neighborhood local searches
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
- Bipartite choices
- On Integrality in Semidefinite Programming for Discrete Optimization
- gym-flp: a Python package for training reinforcement learning algorithms on facility layout problems
- An efficient heuristic for the \(k\)-partitioning problem
- An experimental study of variable depth search algorithms for the quadratic assignment problem
- GRASP with path-relinking for facility layout
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)