论文信息 - Flow pack facets of the single node fixed-charge flow polytope

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

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.

Alper Atamtürk | Alper Atamtürk

[1] Jan Stallaert. The Complementary Class of Generalized Flow Cover Inequalities , 1997, Discret. Appl. Math..

[2] Laurence A. Wolsey,et al. The 0-1 Knapsack problem with a single continuous variable , 1999, Math. Program..

[3] Martin W. P. Savelsbergh,et al. MINTO, a mixed INTeger optimizer , 1994, Oper. Res. Lett..

[4] Laurence A. Wolsey,et al. Uncapacitated lot-sizing: The convex hull of solutions , 1984 .

[5] Laurence A. Wolsey,et al. Capacitated Facility Location: Valid Inequalities and Facets , 1995, Math. Oper. Res..

[6] Laurence A. Wolsey,et al. Valid Inequalities and Superadditivity for 0-1 Integer Programs , 1977, Math. Oper. Res..

[7] Martin W. P. Savelsbergh,et al. Lifted flow cover inequalities for mixed 0-1 integer programs , 1999, Math. Program..

[8] Laurence A. Wolsey,et al. Solving Mixed Integer Programming Problems Using Automatic Reformulation , 1987, Oper. Res..

[9] Laurence A. Wolsey,et al. bc–opt: a branch-and-cut code for mixed integer programs , 1999, Math. Program..

[10] Laurence A. Wolsey,et al. Valid inequalities for mixed 0-1 programs , 1986, Discret. Appl. Math..

[11] Yves Pochet. Valid inequalities and separation for capacitated economic lot sizing , 1988 .

[12] Martin W. P. Savelsbergh,et al. Sequence Independent Lifting in Mixed Integer Programming , 2000, J. Comb. Optim..

[13] Laurence A. Wolsey,et al. Valid Linear Inequalities for Fixed Charge Problems , 1985, Oper. Res..