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
<mark>Journal publication date</mark>1/09/2019
<mark>Journal</mark>Operations Research Letters
Issue number5
Volume47
Number of pages5
Pages (from-to)353-357
Publication statusPublished
Original languageEnglish

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.

Bibliographic 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