Balancing the arrival times of users in a two-stage location problem

DOI10.1007/s10479-015-1886-5zbMath1357.90072OpenAlexW2137765545MaRDI QIDQ512992

Yong-Cai Geng, Sumit K. Garg

Publication date: 3 March 2017

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://researchportal.port.ac.uk/portal/en/publications/balancing-the-arrival-times-of-users-in-a-twostage-location-problem(f85dce6c-3277-41c0-a80f-bfcc6edfbd68).html

zbMATH Keywords

integer programmingequitydiscrete locationtwo-stage

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Closest assignment constraints in discrete location problems
• The discrete facility location problem with balanced allocation of customers
• Equitable service by a facility: minimizing the Gini coefficient
• A comparison of formulations and solution methods for the minimum-envy location problem
• The equitable dispersion problem
• Optimal location with equitable loads
• A flexible model and efficient solution strategies for discrete location problems
• Equity measurement in facility location analysis: A review and framework
• Improved algorithms for several network location problems with equality measures.
• The equitable location problem on the plane
• An extended covering model for flexible discrete and equity location problems
• The minimum weighted covering location problem with distance constraints
• A generalized model of equality measures in network location problems
• Load balancing and capacity constraints in a hierarchical location model
• Public facility location using dispersion, population, and equity criteria
• One-way and round-trip center location problems
• Solving Large p-Median Problems with a Radius Formulation
• Equity-Efficiency Bicriteria Location with Squared Euclidean Distances
• A multi-objective heuristic approach for the casualty collection points location problem
• Equity Maximizing Facility Location Schemes
• An algorithm for the Lorenz measure in locational decisions on trees
• The collection depots location problem on networks
• Minisum collection depots location problem with multiple facilities on a network
• On the collection depots location problem
• The maximum absolute deviation measure in location problems on networks

This page was built for publication: Balancing the arrival times of users in a two-stage location problem