Home > Research > Publications & Outputs > New valid inequalities for the fixed-charge and...

Electronic data

  • single-node-flow

    Rights statement: This is the author’s version of a work that was accepted for publication in Operations Research Letters. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Operations Research Letters, 47, 5, 2019 DOI: 10.1016/j.orl.2019.06.005

    Accepted author manuscript, 328 KB, PDF document

    Embargo ends: 3/01/21

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

New valid inequalities for the fixed-charge and single-node flow polytopes

Research output: Contribution to journalJournal article

Published

Standard

New valid inequalities for the fixed-charge and single-node flow polytopes. / Letchford, Adam; Souli, Georgia.

In: Operations Research Letters, Vol. 47, No. 5, 01.09.2019, p. 353-357.

Research output: Contribution to journalJournal article

Harvard

APA

Vancouver

Author

Letchford, Adam ; Souli, Georgia. / New valid inequalities for the fixed-charge and single-node flow polytopes. In: Operations Research Letters. 2019 ; Vol. 47, No. 5. pp. 353-357.

Bibtex

@article{a35cede14f914ef6b6884c8ddd0f277c,
title = "New valid inequalities for the fixed-charge and single-node flow polytopes",
abstract = "The most effective software packages for solving mixed 0-1 linear programs use strong valid linear inequalities derived from polyhedral theory. We introduce a new procedure which enables one to take known valid inequalities for the knapsack polytope, and convert them into valid inequalities for the fixed-charge and single-node flow polytopes. The resulting inequalities are very different from the previously known inequalities (such as flow cover and flow pack inequalities), and define facets under certain conditions.",
keywords = "mixed-integer linear programming, polyhedral combinatorics, branch-and-cut",
author = "Adam Letchford and Georgia Souli",
note = "This is the author’s version of a work that was accepted for publication in Operations Research Letters. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Operations Research Letters, 47, 5, 2019 DOI: 10.1016/j.orl.2019.06.005",
year = "2019",
month = "9",
day = "1",
doi = "10.1016/j.orl.2019.06.005",
language = "English",
volume = "47",
pages = "353--357",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "5",

}

RIS

TY - JOUR

T1 - New valid inequalities for the fixed-charge and single-node flow polytopes

AU - Letchford, Adam

AU - Souli, Georgia

N1 - This is the author’s version of a work that was accepted for publication in Operations Research Letters. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Operations Research Letters, 47, 5, 2019 DOI: 10.1016/j.orl.2019.06.005

PY - 2019/9/1

Y1 - 2019/9/1

N2 - The most effective software packages for solving mixed 0-1 linear programs use strong valid linear inequalities derived from polyhedral theory. We introduce a new procedure which enables one to take known valid inequalities for the knapsack polytope, and convert them into valid inequalities for the fixed-charge and single-node flow polytopes. The resulting inequalities are very different from the previously known inequalities (such as flow cover and flow pack inequalities), and define facets under certain conditions.

AB - The most effective software packages for solving mixed 0-1 linear programs use strong valid linear inequalities derived from polyhedral theory. We introduce a new procedure which enables one to take known valid inequalities for the knapsack polytope, and convert them into valid inequalities for the fixed-charge and single-node flow polytopes. The resulting inequalities are very different from the previously known inequalities (such as flow cover and flow pack inequalities), and define facets under certain conditions.

KW - mixed-integer linear programming

KW - polyhedral combinatorics

KW - branch-and-cut

U2 - 10.1016/j.orl.2019.06.005

DO - 10.1016/j.orl.2019.06.005

M3 - Journal article

VL - 47

SP - 353

EP - 357

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 5

ER -