Pages that link to "Item:Q3796941"
From MaRDI portal
The following pages link to NP-Hard, Capacitated, Balanced <i>p</i>-Median Problems on a Chain Graph with a Continuum of Link Demands (Q3796941):
Displaying 11 items.
- Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701) (← links)
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197) (← links)
- 2-facility manifold location routing problem (Q526422) (← links)
- A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation (Q645558) (← links)
- Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations (Q1013385) (← links)
- A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations (Q1042058) (← links)
- Global optimization algorithm for capacitated multi-facility continuous location-allocation problems (Q1668802) (← links)
- The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches (Q1695018) (← links)
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem (Q1761969) (← links)
- A hierarchical algorithm for the planar single-facility location routing problem (Q1761993) (← links)
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm (Q1762137) (← links)
