Assignment Problems and the Location of Economic Activities
From MaRDI portal
Publication:3277809
Cited in
(only showing first 100 items - show all)- An exact algorithm for the general quadratic assignment problem
- Probabilistic asymptotic properties of some combinatorial optimization problems
- The facility layout problem
- Entry and structures of interest groups in assignment games
- A heuristic method for the multi-story layout problem
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem
- Finding linear and circular sequences of minimal and maximal total adjacency
- Contributions to the quadratic assignment problem
- Heuristics and their design: A survey
- A heuristic procedure for solving the quadratic assignment problem
- On the quadratic assignment problem
- The core of some location games
- Elitist matching and skewness in income distributions
- Recent models and techniques for solving the layout problem
- Flow network design for manufacturing systems layout
- Experimental analysis of simulated annealing based algorithms for the layout problem
- Simulated annealing for machine layout problems in the presence of zoning constraints
- A multiattribute decision-theoretic approach for the layout design problem
- A distance assignment approach to the facility layout problem
- Generating quadratic assignment test problems with known optimal permutations
- An interactive layout heuristic based on hexagonal adjacency graphs
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Some numerical considerations of optimal allocation with gravity flow costs
- Continuity and uniqueness in revealed preference
- Solving the failure-to-fit problem for plant layout: By changing department shapes and sizes
- A neural network approach to facility layout problems
- A solvable case of the quadratic assignment problem
- Optimizing simulated annealing schedules with genetic programming
- Competitive equilibrium with indivisibilities
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
- Lower bounds for nonlinear assignment problems using many body interactions
- One-dimensional machine location problems in a multi-product flowline with equidistant locations
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- A variant of time minimizing assignment problem
- Walrasian equilibrium with gross substitutes
- A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system
- Large-scale layout of facilities using a heuristic hybrid algorithm
- Lower bounds for the quadratic assignment problem
- An experimental examination into the design of decentralized methods to solve the assignment problem with and without money
- A study of diversification strategies for the quadratic assignment problem
- A genetic approach to the quadratic assignment problem
- A new exact algorithm for the solution of quadratic assignment problems
- Competitive equilibrium in an exchange economy with indivisibilities
- Location and layout planning. A survey
- Solution methods for the balancing of jet turbines
- On the quality of local search 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.
- FACOPT: A user friendly FACility layout OPTimization system.
- Equilibrium in an exchange economy with multiple indivisible commodities and money
- Existence and welfare properties of equilibrium in an exchange economy with multiple divisible and indivisible commodities and linear production technologies
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
- Optimal facility layout and material handling network design
- Solving multi objective facility layout problem by modified simulated annealing
- The stable fixtures problem with payments
- Strategy-proofness of worker-optimal matching with continuously transferable utility
- A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation
- 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
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
- Fast simulated annealing for single-row equidistant facility layout
- A methodology to exploit profit allocation in logistics joint distribution network optimization
- A -accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics
- Locating names on vertices of a transaction network
- The multi-stripe travelling salesman problem
- Revisiting simulated annealing: a component-based analysis
- An improved genetic algorithm based robust approach for stochastic dynamic facility layout problem
- The empirical content of marital surplus in matching models
- Integrating big data analytic and hybrid firefly-chaotic simulated annealing approach for facility layout problem
- ADMM for the SDP relaxation of the QAP
- Critical objective function values in linear sum assignment problems
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- Layout optimisation for an installation port of an offshore wind farm
- Dual bounds of a service level assignment problem with applications to efficient pricing
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices
- Two-sided allocation problems, decomposability, and the impossibility of efficient trade
- Another well-solvable case of the QAP: maximizing the job completion time variance
- New linearizations of quadratic assignment problems
- The dynamic space allocation problem: applying hybrid GRASP and tabu search metaheuristics
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
- Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
- Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach
- A competitive market model for indivisible commodities.
- The package assignment model.
- An improved genetic algorithm for facility layout problems having inner structure walls and passages
- An extreme point algorithm for a local minimum solution to the quadratic assignment problem
- A Lagrangian relaxation algorithm for sparse quadratic assignment problems
- A modification of threshold accepting and its application to the quadratic assignment problem
- Optimal sequences in stochastic single machine shops
- A new exact discrete linear reformulation of the quadratic assignment problem
- A new greedy algorithm for the quadratic assignment problem
- A linear assignment approach for the least-squares protein morphing problem
- Matching with peer monitoring
- The importance of memory for price discovery in decentralized markets
- Multi-level departments-to-offices assignment with different room types
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)