Pages that link to "Item:Q631097"

The following pages link to The discrete facility location problem with balanced allocation of customers (Q631097):

Displaying 17 items.

• The maximin HAZMAT routing problem (Q299771) (← links)
• Closest assignment constraints in discrete location problems (Q439609) (← links)
• Balancing the arrival times of users in a two-stage location problem (Q512992) (← links)
• \(k\)-balanced center location problem: a new multi-objective facility location problem (Q1722964) (← links)
• Integer linear programming models for grid-based light post location problem (Q1926907) (← links)
• A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem (Q2070130) (← links)
• Inverse single facility location problem on a tree with balancing on the distance of server to clients (Q2076390) (← links)
• Service allocation equity in location coverage analytics (Q2083924) (← links)
• Facility location under service level constraints for heterogeneous customers (Q2399319) (← links)
• Equality measures properties for location problems (Q2629900) (← links)
• Inverse and reverse balanced facility location problems with variable edge lengths on trees (Q2656494) (← links)
• The balanced 2-median and 2-maxian problems on a tree (Q2687920) (← links)
• Variable Neighborhood Search for Solving the Balanced Location Problem (Q2840746) (← links)
• Identifying trade‐offs in equity and efficiency for simultaneously optimizing location and multipriority dispatch of ambulances (Q6070972) (← links)
• Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities (Q6092512) (← links)
• The balanced \(p\)-median problem with unitary demand (Q6164621) (← links)
• The reverse selective balance center location problem on trees (Q6191728) (← links)