Cover-based inequalities for the single-source capacitated facility location problem with customer preferences
From MaRDI portal
Cites work
- A cutting plane algorithm for the capacitated facility location problem
- A facility location problem for extracurricular workshop planning: bi-level model and metaheuristics
- A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
- A strengthened formulation for the simple plant location problem with order
- A survey of healthcare facility location
- Analysing the complexity of facility location problems with capacities, revenues, and closest assignments
- Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Capacitated Facility Location: Valid Inequalities and Facets
- Closest assignment constraints and location models: Properties and structure
- Closest assignment constraints in discrete location problems
- Combinatorial optimization. Theory and algorithms
- Facets of the knapsack polytope
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Integer Programming
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- Location-allocation approaches for hospital network planning under uncertainty
- New lower bounds for the facility location problem with clients' preferences
- Polyhedral study of simple plant location problem with order
- Separation algorithms for 0-1 knapsack polytopes
- Solving Large-Scale Zero-One Linear Programming Problems
- Submodular function minimization
- The complexity of cover inequality separation
- Valid inequalities and facets of the capacitated plant location problem
- Weak flow cover inequalities for the capacitated facility location problem
This page was built for publication: Cover-based inequalities for the single-source capacitated facility location problem with customer preferences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6931548)
