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

DOI10.1016/J.DISOPT.2014.12.002MaRDI QIDQ1751105zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

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

Recommendations

• Network design arc set with variable upper bounds
• Polyhedral description of the integer single node flow set with constant bounds
• A Polyhedral Study of Integer Variable Upper Bounds
• On capacitated network design cut-set polyhedra
• Facets for the single node fixed-charge network set with a node set-up variable

Cites work

• A polyhedral study of lot-sizing with supplier selection
• Capacitated Facility Location: Valid Inequalities and Facets
• 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
• Graph Theory and Integer Programming
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Production Planning by Mixed Integer Programming
• The convex hull of two core capacitated network design problems
• Using separation algorithms to generate mixed integer model reformulations
• Valid Linear Inequalities for Fixed Charge Problems

Cited in

(7)

• Convex hull results for generalizations of the constant capacity single node flow set
• Valid inequalities for mixed-integer programmes with fixed charges on sets of variables
• Facets for the single node fixed-charge network set with a node set-up variable
• Polyhedral description of the integer single node flow set with constant bounds
• Lifted Euclidean inequalities for the integer single node flow set with upper bounds
• Network design arc set with variable upper bounds
• The continuous knapsack set

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751105)