Recommendations
Cites work
- scientific article; zbMATH DE number 1803755 (Why is no real title available?)
- scientific article; zbMATH DE number 4209907 (Why is no real title available?)
- scientific article; zbMATH DE number 4170633 (Why is no real title available?)
- scientific article; zbMATH DE number 4059089 (Why is no real title available?)
- scientific article; zbMATH DE number 4106600 (Why is no real title available?)
- scientific article; zbMATH DE number 9247 (Why is no real title available?)
- scientific article; zbMATH DE number 3568354 (Why is no real title available?)
- scientific article; zbMATH DE number 1253042 (Why is no real title available?)
- scientific article; zbMATH DE number 1253055 (Why is no real title available?)
- scientific article; zbMATH DE number 1253056 (Why is no real title available?)
- scientific article; zbMATH DE number 1253059 (Why is no real title available?)
- scientific article; zbMATH DE number 1253061 (Why is no real title available?)
- scientific article; zbMATH DE number 1253066 (Why is no real title available?)
- scientific article; zbMATH DE number 1263290 (Why is no real title available?)
- scientific article; zbMATH DE number 714526 (Why is no real title available?)
- scientific article; zbMATH DE number 714533 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- scientific article; zbMATH DE number 3807643 (Why is no real title available?)
- scientific article; zbMATH DE number 2114494 (Why is no real title available?)
- scientific article; zbMATH DE number 761271 (Why is no real title available?)
- scientific article; zbMATH DE number 821272 (Why is no real title available?)
- scientific article; zbMATH DE number 849181 (Why is no real title available?)
- scientific article; zbMATH DE number 3314878 (Why is no real title available?)
- scientific article; zbMATH DE number 3027356 (Why is no real title available?)
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location
- A Dual-Based Procedure for Uncapacitated Facility Location
- A New Graph-Theoretic Heuristic for Facility Layout
- A New Lower Bound Via Projection for the Quadratic Assignment Problem
- A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
- A branch-and-bound method for multicommodity location with balancing requirements
- A clustering approach to the planar hub location problem
- A comparative evaluation of heuristics forthe adjacency problem in facility layout planning
- A comparison of heuristics and relaxations for the capacitated plant location problem
- A dual-based optimization procedure for the two-echelon uncapacitated facility location problem
- A genetic approach to the quadratic assignment problem
- A heuristic solution to the warehouse location-routing problem
- A new simulated annealing algorithm for the facility layout problem
- A note on solving large p-median problems
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem
- A parallel heuristic for quadratic assignment problems
- A polynomial time algorithm for finding the absolute center of a network
- A projection method for the uncapacitated facility location problem
- A simulated annealing algorithm for allocating space to manufacturing cells
- A squared-euclidean distance location-allocation problem
- A study of diversification strategies for the quadratic assignment problem
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- ADD-heuristics' starting procedures for capacitated plant location models
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
- Algorithms for the m-center problems: A survey
- An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An Improvement-Type Layout Algorithm for Single and Multiple-Floor Facilities
- An Overview of Representative Problems in Location Research
- An algorithm for finding the absolute center of a network
- An algorithm for solving large capacitated warehouse location problems
- An improved annealing scheme for the QAP
- An integrated methodology for automating the determination of layout and materials handling system
- An interactive layout heuristic based on hexagonal adjacency graphs
- Assignment Problems and the Location of Economic Activities
- CLASS: Computerized LAyout Solutions using Simulated annealing
- Comparison of iterative searches for the quadratic assignment problem
- Competitive Location Models: A Framework and Bibliography
- Competitive spatial models
- Constrained Large-Region Multifacility Location Problems
- Construction properties of combinatorial deltahedra
- Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
- Dynamic facility location: The progressive p-median problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- Extensions of a tabu search adaptation to the quadratic assignment problem
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
- Facilities layout generalized model solved by n-boundary shortest path heuristics
- Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers
- Genetic algorithms, function optimization, and facility layout design
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
- Good solutions to discrete noxious location problems via metaheuristics
- Heuristics for the capacitated plant location model
- Is Linear Programming Necessary for Single Facility Location with Maximin of Rectilinear Distance?
- Local Search Algorithms for the Maximal Planar Layout Problem
- Locational analysis
- Microlay: An interactive computer program for factory layout planning on microcomputers
- Modelling Inter-city Road Distances by Mathematical Functions
- Models for multimode multicommodity location problems with interdepot balancing requirements
- Multi-Terminal Network Flows
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
- On the Convergence of a Hyperboloid Approximation Procedure for the Perturbed Euclidean Multifacility Location Problem
- On the convergence of cross decomposition
- On the exact solution of large-scale simple plant location problems
- On worst-case aggregation analysis for network location problems
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- Optimal bin location and sequencing in printed circuit board assembly
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Properties and Solution Methods for Large Location-Allocation Problems
- QAPLIB-A quadratic assignment problem library
- Recent models and techniques for solving the layout problem
- Replacing continuous demand with discrete demand in a competitive location model
- Simple approaches to parallel branch and bound
- Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
- Strengthening Gilmore's bound for the quadratic assignment problem
- TESSA—A new greedy heuristic for facilities layout planning
- Tabu Search Applied to the Quadratic Assignment Problem
- Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- The m-Center Problem
- The Capacitated Traveling Salesman Location Problem
- The Reactive Tabu Search
- The Transportation-Location Problem
- The capacitated plant location problem
- The facility layout problem
- The hub location and routing problem
- The zone-constrained location problem on a network
- Two new heuristic algorithms for the maximal planar layout problem
- Uncapacitated facility location: General solution procedure and computational experience
Cited in
(9)- Integer linear programming models for grid-based light post location problem
- Location and layout planning. An international bibliography
- Metaheuristics: A bibliography
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
- Sequential competitive location on networks
- Models and methods for standardization problems
- Facility location models for distribution planning
- Models and methods for facilities layout design from an applicability to real-world perspective
- Assortment optimization: a systematic literature review
This page was built for publication: Location and layout planning. A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372765)
