Pages that link to "Item:Q1411330"
From MaRDI portal
The following pages link to Solving the simple plant location problem using a data correcting approach (Q1411330):
Displaying 10 items.
- Data aggregation for \(p\)-median problems (Q491200) (← links)
- An exact cooperative method for the uncapacitated facility location problem (Q495932) (← links)
- Complexity evaluation of benchmark instances for the \(p\)-median problem (Q636452) (← links)
- Equivalent instances of the simple plant location problem (Q971550) (← links)
- Branch and peg algorithms for the simple plant location problem. (Q1423442) (← links)
- Fast bounding procedures for large instances of the simple plant location problem (Q1762067) (← links)
- Branch and peg algorithms for the simple plant location problem (Q1765536) (← links)
- An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem (Q2271817) (← links)
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach (Q2572853) (← links)
- Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing (Q3430250) (← links)
