Capacitated facility location: Separation algorithms and computational experience

DOI10.1007/BF01581103zbMath0919.90096MaRDI QIDQ1290613

Karen Aardal

Publication date: 3 June 1999

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

location problems; cutting planes; valid inequalities; facets; capacitated facility location

Mathematics Subject Classification ID

90B80: Discrete location and assignment

Related Items

A family of facets for the uncapacitated \(p\)-median polytope, A new method for solving capacitated location problems based on a set partitioning approach, Cutting planes in integer and mixed integer programming, Polyhedral analysis for concentrator location problems, On solving large instances of the capacitated facility location problem, A branch-and-price algorithm for the capacitated facility location problem, Box-constrained quadratic programs with fixed charge variables, A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem, New modeling approaches for the design of local access transport area networks, A branch and cut algorithm for hub location problems with single assignment, Near-optimal solutions to large-scale facility location problems, On the facets of the simple plant location packing polytope, Multi-period capacitated location with modular equipments, Parallel metaheuristics for workforce planning, Exact procedures for solving the discrete ordered median problem, Locating repair shops in a stochastic environment, Sequence independent lifting for mixed integer programs with variable upper bounds

Uses Software

• MINTO

Cites Work

• A comparison of heuristics and relaxations for the capacitated plant location problem
• Submodularity and valid inequalities in capacitated fixed charge networks
• Valid inequalities and facets of the capacitated plant location problem
• MINTO, a Mixed INTeger Optimizer
• On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
• On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
• Valid Linear Inequalities for Fixed Charge Problems
• Fractional vertices, cuts and facets of the simple plant location problem
• Some facets of the simple plant location polytope
• Faces for a linear inequality in 0–1 variables
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Capacitated Facility Location: Valid Inequalities and Facets
• On the facial structure of set packing polyhedra
• Capacitated Network Design—Polyhedral Structure and Computation