The following pages link to (Q4132252):
Displaying 27 items.
- Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms (Q622140) (← links)
- Logical processing for integer programming (Q817209) (← links)
- The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation (Q864015) (← links)
- Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
- An 0. 828-approximation algorithm for the uncapacitated facility location problem (Q1296569) (← links)
- Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm (Q1718374) (← links)
- Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience (Q1725611) (← links)
- New valid inequalities and facets for the simple plant location problem (Q1749485) (← links)
- An approximation algorithm for a competitive facility location problem with network effects (Q1754226) (← links)
- The plant location problem with demand-dependent setup costs and centralized allocation (Q1806866) (← links)
- The simple plant location problem: Survey and synthesis (Q1837098) (← links)
- On the facets of the simple plant location packing polytope (Q1850113) (← links)
- The double-assignment plant location problem with co-location (Q2026959) (← links)
- A separation algorithm for the simple plant location problem (Q2060615) (← links)
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function (Q2202007) (← links)
- A strengthened formulation for the simple plant location problem with order (Q2643785) (← links)
- Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization (Q2942658) (← links)
- A direct dual method for the mixed plant location problem with some side constraints (Q3206665) (← links)
- An ex-post bound on the greedy heuristic for the uncapacitated facility location problem (Q3411298) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- LP extreme points and cuts for the fixed-charge network design problem (Q3778564) (← links)
- Some facets of the simple plant location polytope (Q3945954) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (Q5091245) (← links)
- Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
- A family of facets for the uncapacitated \(p\)-median polytope (Q5945384) (← links)
- New variants of the simple plant location problem and applications (Q6106762) (← links)
