scientific article; zbMATH DE number 3559283

zbMATH Open0358.90040MaRDI QIDQ4132252FDOQ4132252

Gérard Cornuéjols, Marshall L. Fisher, G. L. Nemhauser

Publication date: 1977

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10)

Cited In (27)

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

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)