Facets for the single node fixed-charge network set with a node set-up variable

DOI10.1007/s11590-013-0677-7zbMath1310.90077OpenAlexW2158562550WikidataQ57736528 ScholiaQ57736528MaRDI QIDQ2448216

Mahdi Doostmohammadi, Agostinho Agra

Publication date: 30 April 2014

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

Full work available at URL: http://hdl.handle.net/10773/21930

zbMATH Keywords

valid inequalitiessingle node flow setmixed integer sets

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (2)

Lifted Euclidean inequalities for the integer single node flow set with upper bounds ⋮ Valid inequalities for the single arc design problem with set-ups

Uses Software

• PORTA

Cites Work

• Unnamed Item
• A polyhedral study of lot-sizing with supplier selection
• Disjunctive programming: Properties of the convex hull of feasible points
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• Discretized formulations for capacitated location problems with modular distribution costs
• Valid Linear Inequalities for Fixed Charge Problems

This page was built for publication: Facets for the single node fixed-charge network set with a node set-up variable