Pages that link to "Item:Q1814816"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem (Q1814816):
Displaying 14 items.
- A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints (Q761340) (← links)
- A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
- On a class of subadditive duals for the uncapacitated facility location problem (Q902981) (← links)
- Separating lifted odd-hole inequalities to solve the index selection problem (Q1304469) (← links)
- An improved branch \& bound method for the uncapacitated competitive location problem (Q1413748) (← links)
- Fast bounding procedures for large instances of the simple plant location problem (Q1762067) (← links)
- A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885) (← links)
- Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule (Q2030506) (← links)
- A separation algorithm for the simple plant location problem (Q2060615) (← links)
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem (Q2257610) (← links)
- The index selection problem with configurations and memory limitation: a scatter search approach (Q2668806) (← links)
- An algorithm for a class of uncapacitated facility location problem based on branch-and-cut method (Q2993681) (← links)
- (Q4229633) (← links)
- Extreme points of discrete location polyhedra (Q5945254) (← links)
