Capacitated facility location: Separation algorithms and computational experience
From MaRDI portal
Publication:1290613
DOI10.1007/BF01581103zbMATH Open0919.90096MaRDI QIDQ1290613FDOQ1290613
Authors: Karen Aardal 
Publication date: 3 June 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
- Weak flow cover inequalities for the capacitated facility location problem
- Capacitated Facility Location: Valid Inequalities and Facets
- A cutting plane algorithm for the capacitated facility location problem
- Valid inequalities and facets of the capacitated plant location problem
- Reformulation of capacitated facility location problems: How redundant information can help
Cites Work
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Faces for a linear inequality in 0–1 variables
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- On the facial structure of set packing polyhedra
- Capacitated Network Design—Polyhedral Structure and Computation
- Valid inequalities and facets of the capacitated plant location problem
- Capacitated Facility Location: Valid Inequalities and Facets
- Valid Linear Inequalities for Fixed Charge Problems
- A comparison of heuristics and relaxations for 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
- Fractional vertices, cuts and facets of the simple plant location problem
- Some facets of the simple plant location polytope
- Submodularity and valid inequalities in capacitated fixed charge networks
Cited In (45)
- Exact procedures for solving the discrete ordered median problem
- Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience
- Locating repair shops in a stochastic environment
- New variants of the simple plant location problem and applications
- Exact and heuristic approaches for the locational planning of an integrated solid waste management system
- An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- Fixed-charge transportation on a path: linear programming formulations
- Box-constrained quadratic programs with fixed charge variables
- Reformulation of capacitated facility location problems: How redundant information can help
- Fixed-charge transportation on a path: optimization, LP formulations and separation
- Polyhedral analysis for concentrator location problems
- New valid inequalities and facets for the simple plant location problem
- Capacitated Facility Location: Valid Inequalities and Facets
- LP-based approximation algorithms for capacitated facility location
- Multi-period capacitated location with modular equipments
- A family of facets for the uncapacitated \(p\)-median polytope
- Parallel metaheuristics for workforce planning
- Weak flow cover inequalities for the capacitated facility location problem
- On solving large instances of the capacitated facility location problem
- Lifting for mixed integer programs with variable upper bounds
- A cutting plane algorithm for the capacitated facility location problem
- A branch-and-price algorithm for the capacitated facility location problem
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- A separation algorithm for the simple plant location problem
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow
- An effective heuristic for large-scale capacitated facility location problems
- Global optimality conditions for fixed charge quadratic programs
- Distribution systems design with role dependent objectives
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- A branch and cut algorithm for hub location problems with single assignment
- A flexible model and efficient solution strategies for discrete location problems
- A new method for solving capacitated location problems based on a set partitioning approach
- A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- Sequence independent lifting for mixed integer programs with variable upper bounds
- Cutting planes in integer and mixed integer programming
- New modeling approaches for the design of local access transport area networks
- An effective hybrid approach to the two-stage capacitated facility location problem
- A hybrid firefly-genetic algorithm for the capacitated facility location problem
- Near-optimal solutions to large-scale facility location problems
- On the facets of the simple plant location packing polytope
- Solving facility location problem based on duality approach
- Title not available (Why is that?)
- Variations in the flow approach to CFCLP-TC for multiobjective supply chain design
Uses Software
This page was built for publication: Capacitated facility location: Separation algorithms and computational experience
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290613)
