Lifted Euclidean inequalities for the integer single node flow set with upper bounds
From MaRDI portal
Publication:322621
DOI10.1016/j.ejor.2015.10.057zbMath1346.90820WikidataQ57736487 ScholiaQ57736487MaRDI QIDQ322621
Agostinho Agra, Miguel Fragoso Constantino
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10773/16480
90C11: Mixed integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B10: Deterministic network models in operations research
Cites Work
- Valid inequalities for mixed 0-1 programs
- The complementary class of generalized flow cover inequalities
- Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
- Facets for the single node fixed-charge network set with a node set-up variable
- Description of 2-integer continuous knapsack polyhedra
- Polyhedral description of the integer single node flow set with constant bounds
- Lower Bounds in Lot-Sizing Models: A Polyhedral Study
- Valid Linear Inequalities for Fixed Charge Problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited