Valid inequalities and facets of the capacitated plant location problem
From MaRDI portal
Publication:1262820
DOI10.1007/BF01587093zbMath0686.90021MaRDI QIDQ1262820
Janny M. Y. Leung, Thomas L. Magnanti
Publication date: 1989
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Polytopes and polyhedra (52Bxx)
Related Items
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design, Integrality gaps for strengthened linear relaxations of capacitated facility location, 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, Discretized formulations for capacitated location problems with modular distribution costs, Submodularity and valid inequalities in capacitated fixed charge networks, Strong formulations for mixed integer programming: A survey, Discrete equal-capacityp-median problem, The value of the multi-period solution revisited: when to model time in capacitated location problems, An integrated <scp>user‐system</scp> approach for shelter location and evacuation routing, The capacitated plant location problem with multiple facilities in the same site, Valid inequalities and separation for capacitated fixed charge flow problems, Variations in the flow approach to CFCLP-TC for multiobjective supply chain design, The splittable flow arc set with capacity and minimum load constraints, Multi-period capacitated location with modular equipments, Classical cuts for mixed-integer programming and branch-and-cut, Location and sizing of offshore platforms for oil exploration, Compressor scheduling in oil fields. Piecewise-linear formulation, valid inequalities, and computational analysis, Polyhedral results for the precedence-constrained knapsack problem, A branch and cut algorithm for hub location problems with single assignment, A Lagrangean heuristic for the plant location problem with multiple facilities in the same site, Extreme points of discrete location polyhedra, A family of facets for the uncapacitated \(p\)-median polytope, Integrated design and operation of remnant inventory supply chains under uncertainty, 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, Facets and algorithms for capacitated lot sizing, Capacitated facility location: Separation algorithms and computational experience, On the facets of the simple plant location packing polytope, New modeling approaches for the design of local access transport area networks, Models for planning capacity expansion in local access telecommunication networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Heuristics for the capacitated plant location model
- Valid inequalities and separation for uncapacitated fixed charge networks
- Valid inequalities for mixed 0-1 programs
- The ellipsoid method and its consequences in combinatorial optimization
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- A class of facet producing graphs for vertex packing polyhedra
- Facets and algorithms for capacitated lot sizing
- The simple plant location problem: Survey and synthesis
- A direct dual method for the mixed plant location problem with some side constraints
- A Cutting Plane Algorithm for the Linear Ordering Problem
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Solving Large-Scale Zero-One Linear Programming Problems
- Facets of the linear ordering polytope
- Valid Linear Inequalities for Fixed Charge Problems
- Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming
- A Cross Decomposition Algorithm for Capacitated Facility Location
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- On the symmetric travelling salesman problem: A computational study
- Fractional vertices, cuts and facets of the simple plant location problem
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- Database Location in Computer Networks
- Inverse Optimization: An Application to the Capacitated Plant Location Problem
- Some facets of the simple plant location polytope
- A Dual-Based Procedure for Dynamic Facility Location
- Set Partitioning: A survey
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Modeling Facility Location Problems as Generalized Assignment Problems
- Properties of vertex packing and independence system polyhedra
- On the facial structure of set packing polyhedra
