Pages that link to "Item:Q1765536"
From MaRDI portal
The following pages link to Branch and peg algorithms for the simple plant location problem (Q1765536):
Displaying 8 items.
- New genetic algorithms based approaches to continuous \(p\)-median problem (Q539099) (← links)
- Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems. (Q703298) (← links)
- On a class of subadditive duals for the uncapacitated facility location problem (Q902981) (← links)
- Branch and peg algorithms for the simple plant location problem. (Q1423442) (← links)
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem (Q2257610) (← links)
- An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem (Q2271817) (← links)
- A strengthened formulation for the simple plant location problem with order (Q2643785) (← links)
- (Q3153223) (← links)