Pages that link to "Item:Q1042058"
From MaRDI portal
The following pages link to A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations (Q1042058):
Displaying 14 items.
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197) (← links)
- Spatial uncertainty in harvest scheduling (Q748578) (← links)
- Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations (Q1013385) (← links)
- Solving probabilistic multi-facility Weber problem by vector quantization (Q1027991) (← links)
- Global optimization algorithm for capacitated multi-facility continuous location-allocation problems (Q1668802) (← links)
- The probabilistic \(p\)-center problem: planning service for potential customers (Q1683071) (← links)
- Variations in the flow approach to CFCLP-TC for multiobjective supply chain design (Q1719200) (← links)
- An algorithm for generalized constrained multi-source Weber problem with demand substations (Q1728411) (← links)
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem (Q1761969) (← links)
- Integer linear programming models for grid-based light post location problem (Q1926907) (← links)
- A directional approach to gradual cover (Q2421326) (← links)
- On the Weber facility location problem with limited distances and side constraints (Q2448124) (← links)
- New heuristic methods for the capacitated multi-facility Weber problem (Q3442870) (← links)
- The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms (Q5172481) (← links)
