Pages that link to "Item:Q4081019"
From MaRDI portal
The following pages link to Note—One-Dimensional Facility Location-Allocation using Dynamic Programming (Q4081019):
Displayed 13 items.
- Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem (Q323162) (← links)
- A new heuristic for solving the \(p\)-median problem in the plane (Q339602) (← links)
- A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand (Q342327) (← links)
- New algorithms for facility location problems on the real line (Q517797) (← links)
- Sequential location-allocation of public facilities in one- and two- dimensional space: Comparison of several policies (Q811354) (← links)
- Optimizing the location of a production firm (Q993460) (← links)
- Stochastic location-assignment on an interval with sequential arrivals (Q993467) (← links)
- Location and sizing of facilities on a line (Q1348709) (← links)
- A two-echelon joint continuous-discrete location model (Q1683143) (← links)
- Classical and inverse median location problems under uncertain environment (Q1987593) (← links)
- Solving multiple facilities location problems with separated clusters (Q2294344) (← links)
- Capacitated location-allocation problems on a line (Q5959397) (← links)
- Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights (Q6049306) (← links)