Locational analysis (Q1173002)

From MaRDI portal

Revision as of 16:45, 13 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Locational analysis	scientific article

Statements

scholarly article

0 references

Locational analysis (English)

0 references

Richard L. Francis

0 references

Leon F. McGinnis

0 references

0 references

European Journal of Operational Research

0 references

publication date

1983

0 references

zbMATH Keywords

locational analysis

0 references

selective review

0 references

reliable algorithms

0 references

planar models

0 references

warehousing models

0 references

network models

0 references

mixed-integer programming models

0 references

facility location

0 references

logistics

0 references

literature survey

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0377-2217(83)90194-7

0 references

An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem

0 references

0 references

An exact branch-and-bound procedure for the quadratic-assignment problem

0 references

Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem

0 references

An integer programming approach to a class of combinatorial problems

0 references

0 references

A characterisation of rigid circuit graphs

0 references

Finding efficient solutions for rectilinear distance location problems efficiently

0 references

Location on Tree Networks: <i>P</i>-Centre and <i>n</i>-Dispersion Problems

0 references

Polynomially bounded algorithms for locatingp-centers on a tree

0 references

A subgradient algorithm for certain minimax and minisum problems

0 references

0 references

A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem

0 references

The Optimum Location of Multi-centres on a Graph

0 references

Matchings and transversals in hypergraphs, domination and independence in trees

0 references

Location-Allocation Problems

0 references

Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms

0 references

Minimax location problems with nonlinear costs

0 references

Convex Location Problems on Tree Networks

0 references

Hospital Layout as a Quadratic Assignment Problem

0 references

A Dual-Based Procedure for Uncapacitated Facility Location

0 references

The Set-Covering Problem: A New Implicit Enumeration Algorithm

0 references

The Lagrangian Relaxation Method for Solving Integer Programming Problems

0 references

Sufficient Conditions for Some Optimum-Property Facility Designs

0 references

Distance Constraints for Tree Network Multifacility Location Problems

0 references

A Dual-Bounded Algorithm for the <i>p</i>-Median Problem

0 references

The <i>m</i>-Center Problem: Minimax Facility Location

0 references

0 references

The Set-Partitioning Problem: Set Covering with Equality Constraints

0 references

Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

0 references

0 references

Multicommodity Distribution System Design by Benders Decomposition

0 references

Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/<i>LP</i> Approach

0 references

Integer Programming Algorithms: A Framework and State-of-the-Art Survey

0 references

An Algorithm for the Quadratic Assignment Problem

0 references

Storage-Retrieval Interleaving in Automatic Warehousing Systems

0 references

0 references

Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

0 references

Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems

0 references

A Review of the Placement and Quadratic Assignment Problems

0 references

0 references

Optimal Storage Assignment in Automatic Warehousing Systems

0 references

Efficient Algorithms for the (Weighted) Minimum Circle Problem

0 references

Easy and hard bottleneck location problems

0 references

An Efficient Computational Procedure for Solving the Multi-Facility Rectilinear Facilities Location Problem

0 references

Trade-off analysis for optimal design of automated warehouses

0 references

An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers

0 references

An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians

0 references

On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems

0 references

An Efficient Branch and Bound Algorithm for the Warehouse Location Problem

0 references

Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem

0 references

Technical Note—Equivalence between the Direct Search Approach and the Cut Approach to the Rectilinear Distance Location Problem

0 references

Selected Families of Location Problems

0 references

Exact and approximate solutions to the multisource weber problem

0 references

0 references

0 references

A note on Fermat's problem

0 references

Modelling Inter-city Road Distances by Mathematical Functions

0 references

Technical Note—Solving Constrained Multi-Facility Location Problems Involving <i>l</i><sub><i>p</i></sub> Distances Using Convex Programming

0 references

Mathematical Models of Road Travel Distances

0 references

Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria

0 references

Relations between packing and covering numbers of a tree

0 references

The <i>m</i>-Center Problem

0 references

0 references

Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function

0 references

Technical Note—Minisum <i>I</i><sub><i>p</i></sub> Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm

0 references

An Improved Algorithm for the Capacitated Facility Location Problem

0 references

A Cut Approach to the Rectilinear Distance Facility Location Problem

0 references

Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem

0 references

An Analysis of Private and Public Sector Location Models

0 references

A branch and bound algorithm for the generalized assignment problem

0 references

Modeling Facility Location Problems as Generalized Assignment Problems

0 references

0 references

Implicit representation of generalized variable upper bounds in linear programming

0 references

0 references

Optimal Facility Location with Concave Costs

0 references

A Class of Balanced Matrices Arising from Location Problems

0 references

On the Core of Cost Allocation Games Defined on Location Problems

0 references

Locating Centers on a Tree with Discontinuous Supply and Demand Regions

0 references

Duality and Distance Constraints for the Nonlinear <i>p</i>-Center Problem and Covering Problem on a Tree Network

0 references

State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure

0 references

The Location of Emergency Service Facilities

0 references

A Cross Decomposition Algorithm for Capacitated Facility Location

0 references

Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems

0 references

0 references

Technical Note—The Optimal Location of New Facilities Using Rectangular Distances

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0377-2217(83)90194-7

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1173002

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1173002&oldid=34676952"