The discrete facility location problem with balanced allocation of customers

DOI10.1016/J.EJOR.2010.10.012zbMATH Open1207.90071OpenAlexW1979287684MaRDI QIDQ631097FDOQ631097

Authors: Alfredo Marín 

Publication date: 22 March 2011

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.10.012

Recommendations

• scientific article; zbMATH DE number 6006831
• The plant location problem with discrete capacities and indivisible customers
• Solving the competitive discretionary service facility location problem
• Improving solution of discrete competitive facility location problems
• Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations
• Discrete competitive facility location: modeling and optimization approaches
• Exact approaches for competitive facility location with discrete attractiveness
• Competitive facility location problem. An algorithm for the problem concerning the existence of multi-type customers
• Probabilistic location problems with discrete demand weights

zbMATH Keywords

integer programmingfacility locationallocationbranch-and-cut

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Discrete location and assignment (90B80)

Cites Work

• Optimal location with equitable loads
• Title not available (Why is that?)
• Title not available (Why is that?)
• Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case
• Equity measurement in facility location analysis: A review and framework
• Equity Maximizing Facility Location Schemes
• The ordered capacitated facility location problem
• Equitable service by a facility: minimizing the Gini coefficient
• A comparison of formulations and solution methods for the minimum-envy location problem
• An extended covering model for flexible discrete and equity location problems
• Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
• A flexible model and efficient solution strategies for discrete location problems
• Sequential location problems
• Outcomes of voting and planning in single facility location problems
• Lagrangean bounds for the optimum communication spanning tree problem
• Discrete location for bundled demand points

Cited In (21)

• \(k\)-balanced center location problem: a new multi-objective facility location problem
• Variable neighborhood search for solving the balanced location problem
• The balanced 2-median and 2-maxian problems on a tree
• The balanced \(p\)-median problem with unitary demand
• The maximin HAZMAT routing problem
• The branch and cut method for the facility location problem with client's preferences
• Closest assignment constraints in discrete location problems
• Equality measures properties for location problems
• Facility location under service level constraints for heterogeneous customers
• Competitive facility location problem. An algorithm for the problem concerning the existence of multi-type customers
• The reverse selective balance center location problem on trees
• Identifying trade‐offs in equity and efficiency for simultaneously optimizing location and multipriority dispatch of ambulances
• Integer linear programming models for grid-based light post location problem
• Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities
• A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
• Inverse single facility location problem on a tree with balancing on the distance of server to clients
• Title not available (Why is that?)
• The plant location problem with discrete capacities and indivisible customers
• Balancing the arrival times of users in a two-stage location problem
• Service allocation equity in location coverage analytics
• Inverse and reverse balanced facility location problems with variable edge lengths on trees

This page was built for publication: The discrete facility location problem with balanced allocation of customers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631097)