The following pages link to Location Science (Q5087283):
Displaying 13 items.
- Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion (Q5058005) (← links)
- Robust Stochastic Facility Location: Sensitivity Analysis and Exact Solution (Q5058018) (← links)
- Advanced network connectivity features and zonal requirements in covering location problems (Q6047840) (← links)
- Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem (Q6065606) (← links)
- A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation (Q6068721) (← links)
- Inverse optimization of integer programming games for parameter estimation arising from competitive retail location selection (Q6087491) (← links)
- Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game (Q6099392) (← links)
- Fairness in maximal covering location problems (Q6106589) (← links)
- Dynamically second-preferred \(p\)-center problem (Q6106963) (← links)
- Territorial design for customers with demand frequency (Q6112738) (← links)
- Hamilton-Jacobi scaling limits of Pareto peeling in 2D (Q6145689) (← links)
- Faster distance-based representative skyline and \(k\)-center along Pareto front in the plane (Q6162513) (← links)
- An efficient Benders decomposition for the \(p\)-median problem (Q6167396) (← links)
