Capacitated facility location: Separation algorithms and computational experience
From MaRDI portal
Publication:1290613
DOI10.1007/BF01581103zbMath0919.90096MaRDI QIDQ1290613
Publication date: 3 June 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items
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, A cutting plane algorithm for the capacitated facility location problem, 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, Global optimality conditions for fixed charge quadratic programs, Solving Facility Location Problem Based on Duality Approach, New variants of the simple plant location problem and applications, Fixed-charge transportation on a path: optimization, LP formulations and separation, An effective hybrid approach to the two-stage capacitated facility location problem, Variations in the flow approach to CFCLP-TC for multiobjective supply chain design, Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience, Box-constrained quadratic programs with fixed charge variables, LP-based approximation algorithms for capacitated facility location, Multi-period capacitated location with modular equipments, Parallel metaheuristics for workforce planning, Fixed-Charge Transportation on a Path: Linear Programming Formulations, A hybrid firefly-genetic algorithm for the capacitated facility location problem, New valid inequalities and facets for the simple plant location problem, Cutting planes in integer and mixed integer programming, A branch and cut algorithm for hub location problems with single assignment, A family of facets for the uncapacitated \(p\)-median polytope, Exact procedures for solving the discrete ordered median problem, Near-optimal solutions to large-scale facility location problems, Weak flow cover inequalities for the capacitated facility location problem, A new method for solving capacitated location problems based on a set partitioning approach, 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, A computational evaluation of a general branch-and-price framework for capacitated network location problems, A flexible model and efficient solution strategies for discrete location problems, Exact and heuristic approaches for the locational planning of an integrated solid waste management system, Distribution systems design with role dependent objectives, An effective heuristic for large-scale capacitated facility location problems, A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem, On the facets of the simple plant location packing polytope, New modeling approaches for the design of local access transport area networks, Locating repair shops in a stochastic environment, Sequence independent lifting for mixed integer programs with variable upper bounds, Lifting for mixed integer programs with variable upper bounds
Uses Software
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
