Pages that link to "Item:Q2993681"
From MaRDI portal
The following pages link to An algorithm for a class of uncapacitated facility location problem based on branch-and-cut method (Q2993681):
Displaying 4 items.
- A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints (Q761340) (← links)
- An improved branch \& bound method for the uncapacitated competitive location problem (Q1413748) (← links)
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
- A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem (Q1814816) (← links)