Locational analysis
From MaRDI portal
Publication:1173002
Cites work
- A branch and bound algorithm for the generalized assignment problem
- A characterisation of rigid circuit graphs
- A Class of Balanced Matrices Arising from Location Problems
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A Cut Approach to the Rectilinear Distance Facility Location Problem
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Dual-Bounded Algorithm for the p-Median Problem
- A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem
- A note on Fermat's problem
- A Review of the Placement and Quadratic Assignment Problems
- A subgradient algorithm for certain minimax and minisum problems
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- An Algorithm for the Quadratic Assignment Problem
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An Analysis of Private and Public Sector Location Models
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
- An Efficient Computational Procedure for Solving the Multi-Facility Rectilinear Facilities Location Problem
- An exact branch-and-bound procedure for the quadratic-assignment problem
- An Improved Algorithm for the Capacitated Facility Location Problem
- An integer programming approach to a class of combinatorial problems
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
- Convex Location Problems on Tree Networks
- Distance Constraints for Tree Network Multifacility Location Problems
- Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
- Easy and hard bottleneck location problems
- Efficient Algorithms for the (Weighted) Minimum Circle Problem
- Exact and approximate solutions to the multisource weber problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Finding efficient solutions for rectilinear distance location problems efficiently
- Hospital Layout as a Quadratic Assignment Problem
- scientific article; zbMATH DE number 3427118 (Why is no real title available?)
- scientific article; zbMATH DE number 3847184 (Why is no real title available?)
- scientific article; zbMATH DE number 3666528 (Why is no real title available?)
- scientific article; zbMATH DE number 3503127 (Why is no real title available?)
- scientific article; zbMATH DE number 3523478 (Why is no real title available?)
- scientific article; zbMATH DE number 3561083 (Why is no real title available?)
- scientific article; zbMATH DE number 3566547 (Why is no real title available?)
- scientific article; zbMATH DE number 3568354 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 3230946 (Why is no real title available?)
- scientific article; zbMATH DE number 3291744 (Why is no real title available?)
- scientific article; zbMATH DE number 3395637 (Why is no real title available?)
- scientific article; zbMATH DE number 3027356 (Why is no real title available?)
- Implicit representation of generalized variable upper bounds in linear programming
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
- Locating Centers on a Tree with Discontinuous Supply and Demand Regions
- Location on Tree Networks: P-Centre and n-Dispersion Problems
- Location-Allocation Problems
- Matchings and transversals in hypergraphs, domination and independence in trees
- Mathematical Models of Road Travel Distances
- Minimax location problems with nonlinear costs
- Modeling Facility Location Problems as Generalized Assignment Problems
- Modelling Inter-city Road Distances by Mathematical Functions
- Multicommodity Distribution System Design by Benders Decomposition
- Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
- On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems
- On the Core of Cost Allocation Games Defined on Location Problems
- Optimal Facility Location with Concave Costs
- Optimal Storage Assignment in Automatic Warehousing Systems
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- Polynomially bounded algorithms for locatingp-centers on a tree
- Relations between packing and covering numbers of a tree
- Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
- Selected Families of Location Problems
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- Storage-Retrieval Interleaving in Automatic Warehousing Systems
- Sufficient Conditions for Some Optimum-Property Facility Designs
- Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
- Technical Note—Equivalence between the Direct Search Approach and the Cut Approach to the Rectilinear Distance Location Problem
- Technical Note—Minisum Ip Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
- Technical Note—Solving Constrained Multi-Facility Location Problems Involving lp Distances Using Convex Programming
- Technical Note—The Optimal Location of New Facilities Using Rectangular Distances
- The m-Center Problem
- The m-Center Problem: Minimax Facility Location
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The Location of Emergency Service Facilities
- The Optimum Location of Multi-centres on a Graph
- The Set-Covering Problem: A New Implicit Enumeration Algorithm
- The Set-Partitioning Problem: Set Covering with Equality Constraints
- Trade-off analysis for optimal design of automated warehouses
Cited in
(46)- A correction to the definition of local center
- A simple plant-location model for quantity-setting firms subject to price uncertainty
- Location problems
- ADD-heuristics' starting procedures for capacitated plant location models
- On the set partitioning type formulation for the discrete location problem
- On the exact solution of large-scale simple plant location problems
- A location-distribution application for a beer company
- Minimax algebra and applications
- An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies
- The capacitated distribution and waste disposal problem
- A bi-objective uncapacitated facility location problem
- Application of facility location modeling constructs to vendor selection problems
- Uncapacitated facility location: General solution procedure and computational experience
- Solving the staircase cost facility location problem with decomposition and piecewise linearization
- On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures
- Location and layout planning. A survey
- Using tropical optimization to solve constrained minimax single-facility location problems with rectilinear distance
- Strategic facility location: A review
- A multifactor model for international plant location and financing under uncertainty
- Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
- Maxpolynomial equations
- Algebraic solution of minimax single-facility constrained location problems with Chebyshev and rectilinear distances
- Equilibria in non-cooperative competition of political parties having a common rate of morality
- Lower and upper bounds for a two-level hierarchical location problem in computer networks
- Steiner diagrams and \(k\)-star hubs
- A particle swarm optimization algorithm with path relinking for the location routing problem
- ISO-cost contours to facility location problems in the presence of circular and polygonal forbidden regions
- Multiobjective analysis of facility location decisions
- Solving the simple plant location problem by genetic algorithm
- A multi-objective model for locating search and rescue boats
- Ant colony system solving capacitated location-allocation problems on a line
- Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
- Comments on ‘Facility location problem on network under multiple criteria fuzzy set theoretic approach’
- Optimization models for the dynamic facility location and allocation problem
- New approach to facility locations decisions
- Single facility location problem with region-dependent distance metrics
- Application of facilities location to an insurance company’s office reconfiguration
- International facilities location: A heuristic procedure for the dynamic uncapacitated problem
- An algorithm for the capacitated, multi-commodity multi-period facility location problem.
- Capacitated location-allocation problems on a line
- On worst-case aggregation analysis for network location problems
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- A comparison of heuristics and relaxations for the capacitated plant location problem
- Designing a distribution network in a supply chain system: formulation and efficient solution procedure
- A review of hierarchical facility location models
- The general optimal market area model
This page was built for publication: Locational analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1173002)
