scientific article; zbMATH DE number 3559283
From MaRDI portal
Publication:4132252
zbMath0358.90040MaRDI QIDQ4132252
Cornuéjols, Gérard, Marshall L. Fisher, Nemhauser, George I.
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization, A strengthened formulation for the simple plant location problem with order, The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation, A direct dual method for the mixed plant location problem with some side constraints, Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization, Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms, New variants of the simple plant location problem and applications, Constrained Submodular Maximization via a Nonsymmetric Technique, LP extreme points and cuts for the fixed-charge network design problem, A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function, Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm, Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience, New valid inequalities and facets for the simple plant location problem, An approximation algorithm for a competitive facility location problem with network effects, A family of facets for the uncapacitated \(p\)-median polytope, The double-assignment plant location problem with co-location, The plant location problem with demand-dependent setup costs and centralized allocation, Valid inequalities and facets of the capacitated plant location problem, Online Submodular Maximization with Preemption, A separation algorithm for the simple plant location problem, A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints, An ex-post bound on the greedy heuristic for the uncapacitated facility location problem, The simple plant location problem: Survey and synthesis, An 0. 828-approximation algorithm for the uncapacitated facility location problem, On the facets of the simple plant location packing polytope, Some facets of the simple plant location polytope, Logical processing for integer programming
