Pages that link to "Item:Q4044368"
From MaRDI portal
The following pages link to A cost function property for plant location problems (Q4044368):
Displaying 14 items.
- Multi-level facility location as the maximization of a submodular set function (Q320143) (← links)
- Fast approximate energy minimization with label costs (Q409135) (← links)
- A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints (Q761340) (← links)
- A branch-and-bound algorithm for the multi-level uncapacitated facility location problem (Q795714) (← links)
- The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527) (← links)
- Maximization of submodular functions: theory and enumeration algorithms (Q1027590) (← links)
- The simple plant location problem: Survey and synthesis (Q1837098) (← links)
- Almost-smooth histograms and sliding-window graph algorithms (Q2088588) (← links)
- Hub Location as the Minimization of a Supermodular Set Function (Q2935299) (← links)
- Comments on the note of Frieze (Q4047390) (← links)
- An analysis of approximations for maximizing submodular set functions—I (Q4152030) (← links)
- The multi-level uncapacitated facility location problem is not submodular (Q5906501) (← links)
- The multi-level uncapacitated facility location problem is not submodular (Q5967058) (← links)
- Interview with Alan Frieze (Q6659984) (← links)