Flow pack facets of the single node fixed-charge flow polytope

Authors:
Alper AtamtüRk
Affiliations:
Department of Industrial Engineering and Operations Research, University of California at Berkeley, Berkeley, CA 94720-1777, USA
Venue:
Operations Research Letters
Year:
2001

Citing 6
Cited 5

Valid inequalities for mixed 0-1 programs

Discrete Applied Mathematics
Solving mixed integer programming problems using automatic reformulation

Operations Research
Capacitated facility location: valid inequalities and facets

Mathematics of Operations Research
The complementary class of generalized flow cover inequalities

Discrete Applied Mathematics
Software section: MINTO, a mixed INTeger optimizer

Operations Research Letters
Valid inequalities and separation for capacitated economic lot sizing

Operations Research Letters

Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation

Operations Research
Box-constrained quadratic programs with fixed charge variables

Journal of Global Optimization
A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Fixed-Charge Transportation with Product Blending

Transportation Science
Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a class of facet-defining inequalities for the single node fixed-charge flow polytope and provide a comparison of valid inequalities for this polytope. We also present computational results that show the effectiveness of these inequalities in solving fixed-charge network flow problems.