Pages that link to "Item:Q3277809"
From MaRDI portal
The following pages link to Assignment Problems and the Location of Economic Activities (Q3277809):
Displayed 50 items.
- A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation (Q1651538) (← links)
- Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments (Q1652644) (← links)
- Tabu search and iterated local search for the cyclic bottleneck assignment problem (Q1652664) (← links)
- Integer programming models and linearizations for the traveling car renter problem (Q1653275) (← links)
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems (Q1662098) (← links)
- Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
- A methodology to exploit profit allocation in logistics joint distribution network optimization (Q1666679) (← links)
- A \(\beta\)-accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics (Q1681320) (← links)
- Locating names on vertices of a transaction network (Q1683066) (← links)
- The multi-stripe travelling salesman problem (Q1698268) (← links)
- Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
- An improved genetic algorithm based robust approach for stochastic dynamic facility layout problem (Q1726977) (← links)
- The empirical content of marital surplus in matching models (Q1730157) (← links)
- Integrating big data analytic and hybrid firefly-chaotic simulated annealing approach for facility layout problem (Q1730523) (← links)
- ADMM for the SDP relaxation of the QAP (Q1741118) (← links)
- Critical objective function values in linear sum assignment problems (Q1743488) (← links)
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
- Layout optimisation for an installation port of an offshore wind farm (Q1751774) (← links)
- Dual bounds of a service level assignment problem with applications to efficient pricing (Q1754037) (← links)
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices (Q1754256) (← links)
- Two-sided allocation problems, decomposability, and the impossibility of efficient trade (Q1757552) (← links)
- Another well-solvable case of the QAP: maximizing the job completion time variance (Q1758277) (← links)
- New linearizations of quadratic assignment problems (Q1761235) (← links)
- The dynamic space allocation problem: applying hybrid GRASP and tabu search metaheuristics (Q1762023) (← links)
- A performance guarantee heuristic for electronic components placement problems including thermal effects (Q1781568) (← links)
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure (Q1785334) (← links)
- Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems (Q1789471) (← links)
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem (Q1821011) (← links)
- Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach (Q1850122) (← links)
- A competitive market model for indivisible commodities. (Q1853705) (← links)
- The package assignment model. (Q1867556) (← links)
- An improved genetic algorithm for facility layout problems having inner structure walls and passages (Q1869891) (← links)
- An extreme point algorithm for a local minimum solution to the quadratic assignment problem (Q1877896) (← links)
- A Lagrangian relaxation algorithm for sparse quadratic assignment problems (Q1904611) (← links)
- A modification of threshold accepting and its application to the quadratic assignment problem (Q1909011) (← links)
- Optimal sequences in stochastic single machine shops (Q1919778) (← links)
- A new exact discrete linear reformulation of the quadratic assignment problem (Q1926740) (← links)
- A new greedy algorithm for the quadratic assignment problem (Q1940429) (← links)
- A linear assignment approach for the least-squares protein morphing problem (Q1960195) (← links)
- Matching with peer monitoring (Q1995318) (← links)
- The importance of memory for price discovery in decentralized markets (Q1995460) (← links)
- Multi-level departments-to-offices assignment with different room types (Q2002846) (← links)
- A competitive partnership formation process (Q2016227) (← links)
- Optimal test allocation (Q2025034) (← links)
- Efficiency, stability, and commitment in senior level job matching markets (Q2025051) (← links)
- A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
- Matching markets and cultural selection (Q2070745) (← links)
- Sampled Gromov Wasserstein (Q2071351) (← links)