Assignment Problems and the Location of Economic Activities
From MaRDI portal
Publication:3277809
Cited in
(only showing first 100 items - show all)- Solving the quadratic assignment problem
- Repulsive assignment problem
- Local Search Algorithms for the Maximal Planar Layout Problem
- An efficient algorithm for unequal area facilities layout planning with input and output points
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices
- Probabilistic stopping rules for GRASP heuristics and extensions
- Selection hyper-heuristics for the multi and many-objective quadratic assignment problem
- 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
- Inductive linearization for binary quadratic programs with linear constraints
- A new algorithm for solving a special matching problem with a general form value function under constraints
- Continuous relaxations for the traveling salesman problem
- 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
- The linearization problem of a binary quadratic problem and its applications
- Stability properties of the core in a generalized assignment problem
- Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme
- A marriage matching function with flexible spillover and substitution patterns
- Integrating big data analytic and hybrid firefly-chaotic simulated annealing approach for facility layout problem
- The empirical content of marital surplus in matching models
- 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
- Multi-level departments-to-offices assignment with different room types
- A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation
- The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
- Embedding signed graphs in the line
- Continuity and uniqueness in revealed preference
- Dual bounds of a service level assignment problem with applications to efficient pricing
- The multi-stripe travelling salesman problem
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- Learning to match via inverse optimal transport
- Revisiting simulated annealing: a component-based analysis
- Taking advantage of symmetry in some quadratic assignment problems
- 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?
- The dynamic space allocation problem: applying hybrid GRASP and tabu search metaheuristics
- A tabu search heuristic for the dynamic space allocation problem
- Matching with peer monitoring
- The importance of memory for price discovery in decentralized markets
- 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
- A proximal DC approach for quadratic assignment problem
- The repeated p-dispersion problem
- A competitive market model for indivisible commodities.
- An improved genetic algorithm based robust approach for stochastic dynamic facility layout problem
- Problema de asignacion cuadratica multiobjetivo
- Matching and a technology-induced skewness in income distributions
- Genetic algorithm for linear and cyclic assignment problem
- Strategy-proofness of worker-optimal matching with continuously transferable utility
- The stable fixtures problem with payments
- 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
- 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
- FACOPT: A user friendly FACility layout OPTimization system.
- Construction heuristics for the single row layout problem with machine-spanning clearances
- Formulating and solving sustainable stochastic dynamic facility layout problem: a key to sustainable operations
- Decentralized matching markets of various sizes: similarly stable solutions with high proportions of equal splits
- Efficiency, stability, and commitment in senior level job matching markets
- Some numerical considerations of optimal allocation with gravity flow costs
- Two-level modified simulated annealing based approach for solving facility layout problem
- 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
- One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations
- A \(\beta\)-accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics
- Locating names on vertices of a transaction network
- Garden optimization problems for benchmarking quantum annealers
- Two-sided allocation problems, decomposability, and the impossibility of efficient trade
- A note on a polynomial time solvable case of the quadratic assignment problem
- A new tractable case of the QAP with a Robinson matrix
- 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
- Sampled Gromov Wasserstein
- Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability
- Critical objective function values in linear sum assignment problems
- Well-solvable cases of the QAP with block-structured matrices
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)
