Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem

DOI10.1137/15M1033009zbMath1370.90151arXiv1705.05920OpenAlexW2616750249MaRDI QIDQ5355207

Simge Küçükyavuz, Atamtürk, Alper, Birce Tezel

Publication date: 7 September 2017

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.05920

zbMATH Keywords

valid inequalitiesmixed-integer programmingsubmodular functionsfixed-charge networkscovers and packs

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (9)

Sequence Independent Lifting for the Set of Submodular Maximization Problem ⋮ Theoretical challenges towards cutting-plane selection ⋮ Minimum‐cost flow problems having arc‐activation costs ⋮ A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation ⋮ Supermodularity and valid inequalities for quadratic optimization with indicators ⋮ Two-level lot-sizing with inventory bounds ⋮ Convex hull results for generalizations of the constant capacity single node flow set ⋮ Submodular function minimization and polarity ⋮ Sequence independent lifting for a set of submodular maximization problems

Cites Work

• Unnamed Item
• A note on ``Lot-sizing with fixed charges on stocks: the convex hull
• Uncapacitated lot sizing with backlogging: the convex hull
• Valid inequalities and separation for uncapacitated fixed charge networks
• Valid inequalities for mixed 0-1 programs
• Lot-size models with backlogging: Strong reformulations and cutting planes
• Submodularity and valid inequalities in capacitated fixed charge networks
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
• The complementary class of generalized flow cover inequalities
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• Polyhedra for lot-sizing with Wagner-Whitin costs
• Lot-sizing with fixed charges on stocks: the convex hull
• Fixed-charge transportation on a path: optimization, LP formulations and separation
• Valid Linear Inequalities for Fixed Charge Problems
• A Faster Deterministic Maximum Flow Algorithm
• Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
• Flow pack facets of the single node fixed-charge flow polytope

This page was built for publication: Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem