Valid inequalities for the single arc design problem with set-ups

DOI10.1016/j.disopt.2014.12.002zbMath1387.90149OpenAlexW2088460954WikidataQ57736525 ScholiaQ57736525MaRDI QIDQ1751105

Agostinho Agra, Mahdi Doostmohammadi, Quentin Louveaux

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2014.12.002

zbMATH Keywords

facet-defining inequalitiesmixed integer programmingvalid inequalities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Cites Work

• A polyhedral study of lot-sizing with supplier selection
• The convex hull of two core capacitated network design problems
• Using separation algorithms to generate mixed integer model reformulations
• Disjunctive programming: Properties of the convex hull of feasible points
• Facets for the single node fixed-charge network set with a node set-up variable
• Valid Linear Inequalities for Fixed Charge Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Graph Theory and Integer Programming
• Capacitated Facility Location: Valid Inequalities and Facets
• Production Planning by Mixed Integer Programming
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited

This page was built for publication: Valid inequalities for the single arc design problem with set-ups