Valid inequalities and facets of the capacitated plant location problem (Q1262820): Difference between revisions

The authors investigate the polyhedral structure of the capacitated plant location problem. A family of so-called residual capacity inequalities is considered and it is shown that most of these inequalities are facets. Some modified versions of the capacitated plant location problem are also examined.

0 references

Mathematics Subject Classification ID

90B05

0 references

0 references

0 references

0 references

0 references

polyhedral structure

0 references

capacitated plant location

0 references

capacity inequalities

0 references

facets

0 references

reviewed by

Johannes Terno

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Set Partitioning: A survey

0 references

Strong Formulations for Multi-Item Capacitated Lot Sizing

0 references

Inverse Optimization: An Application to the Capacitated Plant Location Problem

0 references

On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets

0 references

On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems

0 references

Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem

0 references

Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms

0 references

Q4132252

0 references

Q3351135

0 references

Some facets of the simple plant location polytope

0 references

Solving Large-Scale Zero-One Linear Programming Problems

0 references

Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality

0 references

Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition

0 references

Database Location in Computer Networks

0 references

A Cutting Plane Algorithm for the Linear Ordering Problem

0 references

Facets of the linear ordering polytope

0 references

The ellipsoid method and its consequences in combinatorial optimization

0 references

Fractional vertices, cuts and facets of the simple plant location problem

0 references

A direct dual method for the mixed plant location problem with some side constraints

0 references

Heuristics for the capacitated plant location model

0 references

Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models

0 references

The simple plant location problem: Survey and synthesis

0 references

Facets and algorithms for capacitated lot sizing

0 references

Q3352833

0 references

Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming

0 references

Properties of vertex packing and independence system polyhedra

0 references

On the facial structure of set packing polyhedra

0 references

On the symmetric travelling salesman problem: A computational study

0 references

Valid Linear Inequalities for Fixed Charge Problems

0 references

Modeling Facility Location Problems as Generalized Assignment Problems

0 references

A class of facet producing graphs for vertex packing polyhedra

0 references

A Cross Decomposition Algorithm for Capacitated Facility Location

0 references

A Dual-Based Procedure for Dynamic Facility Location

0 references

Valid inequalities and separation for uncapacitated fixed charge networks

0 references

Valid inequalities for mixed 0-1 programs

0 references

Q3220049

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1262820

@@ Property / cites work @@
+Set Partitioning: A survey
@@ Property / cites work: Set Partitioning: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Strong Formulations for Multi-Item Capacitated Lot Sizing
+Normal rank
@@ Property / cites work @@
+Inverse Optimization: An Application to the Capacitated Plant Location Problem
+Normal rank
@@ Property / cites work @@
+On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
+Normal rank
@@ Property / cites work @@
+On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
+Normal rank
@@ Property / cites work @@
+Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
+Normal rank
@@ Property / cites work @@
+Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
+Normal rank
@@ Property / cites work @@
+Q4132252
@@ Property / cites work: Q4132252 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3351135
@@ Property / cites work: Q3351135 / rank @@
+Normal rank
@@ Property / cites work @@
+Some facets of the simple plant location polytope
@@ Property / cites work: Some facets of the simple plant location polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Large-Scale Zero-One Linear Programming Problems
+Normal rank
@@ Property / cites work @@
+Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
+Normal rank
@@ Property / cites work @@
+Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
+Normal rank
@@ Property / cites work @@
+Database Location in Computer Networks
@@ Property / cites work: Database Location in Computer Networks / rank @@
+Normal rank
@@ Property / cites work @@
+A Cutting Plane Algorithm for the Linear Ordering Problem
+Normal rank
@@ Property / cites work @@
+Facets of the linear ordering polytope
@@ Property / cites work: Facets of the linear ordering polytope / rank @@
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Fractional vertices, cuts and facets of the simple plant location problem
+Normal rank
@@ Property / cites work @@
+A direct dual method for the mixed plant location problem with some side constraints
+Normal rank
@@ Property / cites work @@
+Heuristics for the capacitated plant location model
+Normal rank
@@ Property / cites work @@
+Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
+Normal rank
@@ Property / cites work @@
+The simple plant location problem: Survey and synthesis
+Normal rank
@@ Property / cites work @@
+Facets and algorithms for capacitated lot sizing
@@ Property / cites work: Facets and algorithms for capacitated lot sizing / rank @@
+Normal rank
@@ Property / cites work @@
+Q3352833
@@ Property / cites work: Q3352833 / rank @@
+Normal rank
@@ Property / cites work @@
+Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming
+Normal rank
@@ Property / cites work @@
+Properties of vertex packing and independence system polyhedra
+Normal rank
@@ Property / cites work @@
+On the facial structure of set packing polyhedra
@@ Property / cites work: On the facial structure of set packing polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+On the symmetric travelling salesman problem: A computational study
+Normal rank
@@ Property / cites work @@
+Valid Linear Inequalities for Fixed Charge Problems
+Normal rank
@@ Property / cites work @@
+Modeling Facility Location Problems as Generalized Assignment Problems
+Normal rank
@@ Property / cites work @@
+A class of facet producing graphs for vertex packing polyhedra
+Normal rank
@@ Property / cites work @@
+A Cross Decomposition Algorithm for Capacitated Facility Location
+Normal rank
@@ Property / cites work @@
+A Dual-Based Procedure for Dynamic Facility Location
+Normal rank
@@ Property / cites work @@
+Valid inequalities and separation for uncapacitated fixed charge networks
+Normal rank
@@ Property / cites work @@
+Valid inequalities for mixed 0-1 programs
@@ Property / cites work: Valid inequalities for mixed 0-1 programs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3220049
@@ Property / cites work: Q3220049 / rank @@
+Normal rank