Pages that link to "Item:Q1129969"
From MaRDI portal
The following pages link to A discretizing algorithm for location problems (Q1129969):
Displaying 20 items.
- Continuous multifacility ordered median location problems (Q322399) (← links)
- Algorithms for location problems based on angular distances (Q471721) (← links)
- A flexible model and efficient solution strategies for discrete location problems (Q1028444) (← links)
- Solving general continuous single facility location problems by cutting planes (Q1086129) (← links)
- Algorithms of placing recovery points (Q1111383) (← links)
- Maximin location: Discretization not always works (Q1284606) (← links)
- An algorithm for continuous type optimal location problem (Q1360248) (← links)
- A discrete location problem (Q1433487) (← links)
- Using interval analysis for solving planar single-facility location problems: New discarding tests (Q1595899) (← links)
- Decomposition of the location problem (Q1819693) (← links)
- Approximation of solutions for location problems (Q1821683) (← links)
- On location-allocation problems for dimensional facilities (Q2317850) (← links)
- A bibliography for some fundamental problem categories in discrete location science (Q2384836) (← links)
- Location problems with different norms for different points (Q2569201) (← links)
- A continuous strategy to solve a class of discrete optimization problems (Q2883574) (← links)
- A candidate set construction method in distribution center location based on a multi-scale gridding model (Q2916074) (← links)
- An application of the great deluge algorithm in planar location problems (Q2916878) (← links)
- (Q3307247) (← links)
- A discrete algorithm for localizing the discontinuity lines of a function of two variables (Q5374038) (← links)
- A Two‐Stage Algorithm for Solving a Discrete Minisum Problem (Q5903064) (← links)
