scientific article; zbMATH DE number 3559283

Cited in

(27)

Some facets of the simple plant location polytope
A direct dual method for the mixed plant location problem with some side constraints
Valid inequalities and facets of the capacitated plant location problem
A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function
Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms
The double-assignment plant location problem with co-location
Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience
An 0. 828-approximation algorithm for the uncapacitated facility location problem
New variants of the simple plant location problem and applications
An ex-post bound on the greedy heuristic for the uncapacitated facility location problem
A strengthened formulation for the simple plant location problem with order
Logical processing for integer programming
LP extreme points and cuts for the fixed-charge network design problem
New valid inequalities and facets for the simple plant location problem
Bounds on double-sided myopic algorithms for unconstrained non-monotone submodular maximization
A tight linear time (1/2)-approximation for unconstrained submodular maximization
The plant location problem with demand-dependent setup costs and centralized allocation
Constrained submodular maximization via a nonsymmetric technique
Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm
The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation
Online submodular maximization with preemption
The simple plant location problem: Survey and synthesis
A separation algorithm for the simple plant location problem
On the facets of the simple plant location packing polytope
A family of facets for the uncapacitated \(p\)-median polytope
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
An approximation algorithm for a competitive facility location problem with network effects

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132252)