Pages that link to "Item:Q1000990"
From MaRDI portal
The following pages link to A comparison of formulations and solution methods for the minimum-envy location problem (Q1000990):
Displaying 20 items.
- Inequity averse optimization in operational research (Q319581) (← links)
- On discrete optimization with ordering (Q367635) (← links)
- Balancing the arrival times of users in a two-stage location problem (Q512992) (← links)
- The discrete facility location problem with balanced allocation of customers (Q631097) (← links)
- Single-allocation ordered median hub location problems (Q709204) (← links)
- Emergency medical services and beyond: addressing new challenges through a wide literature review (Q1652096) (← links)
- Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
- Recent optimization models and trends in location, relocation, and dispatching of emergency medical vehicles (Q1991100) (← links)
- On single-source capacitated facility location with cost and fairness objectives (Q2029269) (← links)
- A branch-and-price approach for the continuous multifacility monotone ordered median problem (Q2106721) (← links)
- Lexicographical order in integer programming (Q2405486) (← links)
- Equality measures properties for location problems (Q2629900) (← links)
- A kernel search heuristic for a fair facility location problem (Q2668732) (← links)
- Effectiveness-equity models for facility location problems on tree networks (Q2811312) (← links)
- Identifying trade‐offs in equity and efficiency for simultaneously optimizing location and multipriority dispatch of ambulances (Q6070972) (← links)
- Constraint relaxation for the discrete ordered median problem (Q6081610) (← links)
- Fairness in maximal covering location problems (Q6106589) (← links)
- Dynamically second-preferred \(p\)-center problem (Q6106963) (← links)
- Fix-and-optimize approach for a healthcare facility location/network design problem considering equity and accessibility: a case study (Q6135637) (← links)
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)