'Multidimensional' extensions and a nested dual approach for the m-median problem

DOI10.1016/0377-2217(85)90096-7zbMath0587.90037OpenAlexW2030575165MaRDI QIDQ1072925

Aissa Oudjit, Pitu B. Mirchandani, Richard T. Wong

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90096-7

zbMATH Keywords

Lagrange multipliersstochastic networkslarge scale problemsdual multiplierdual simplex procedureLagrangean subproblemsmedian-type locationmulticommodity networksmultiple minisum-type objectivesnested procedure

Mathematics Subject Classification ID

Integer programming (90C10) Inventory, storage, reservoirs (90B05)

Related Items (16)

Multiobjective analysis of facility location decisions ⋮ On stochastic \(k\)-facility location ⋮ \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis ⋮ The stochastic location model with risk pooling ⋮ Computational study of large-scale \(p\)-median problems ⋮ On the exact solution of large-scale simple plant location problems ⋮ An improved algorithm for the minmax regret path centdian problem on trees ⋮ Integrated location and two-echelon inventory network design under uncertainty ⋮ A method for solving to optimality uncapacitated location problems ⋮ Discrete facility location with nonlinear diseconomies in fixed costs ⋮ Optimization of competitive facility location for chain stores ⋮ Facility location models for distribution system design ⋮ Alternate solution approaches for competitive hub location problems ⋮ US coast guard air station location with respect to distress calls: a spatial statistics and optimization based methodology ⋮ Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems ⋮ On the minmax regret path median problem on trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The file allocation problem under dynamic usage
• A tree search algorithm for the p-median problem
• Selected Families of Location Problems
• A Dual-Based Procedure for Uncapacitated Facility Location
• A Dual-Bounded Algorithm for the p-Median Problem
• Localizing 2‐medians on probabilistic and deterministic tree networks
• A dual algorithm for the constrained shortest path problem
• An Indirect Method for the Generalized k-Median Problem Applied to Lock-Box Location
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• A Dual-Based Procedure for Dynamic Facility Location
• Pseudo-Boolean Solutions to Multidimensional Location Problems
• Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
• Multicommodity Distribution System Design by Benders Decomposition
• The Simple Plant-Location Problem under Uncertainty
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Technical Note—An Algorithm for the p-Median Problem
• A Note on Warszawski's Multi-Commodity Location Problem
• Validation of subgradient optimization
• Public Facilities Location Under Stochastic Demand
• Integer Programming: Methods, Uses, Computations
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations on a Graph with Probabilistic Demands
• A man-machine approach toward solving the traveling salesman problem
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• Optimum Locations of Centers in Networks
• Multi-Dimensional Location Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: 'Multidimensional' extensions and a nested dual approach for the m-median problem