The splittable flow arc set with capacity and minimum load constraints

DOI10.1016/j.orl.2013.07.005zbMath1286.90169OpenAlexW2168856283MaRDI QIDQ2450712

Hande Yaman

Publication date: 15 May 2014

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/20846

zbMATH Keywords

convex hullsplittable flow arc setmixed integer knapsack setminimum load constraintsresidual capacity inequalities

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Related Items (1)

The continuous knapsack set

Cites Work

• The vendor location problem
• On a class of mixed-integer sets with a single integer variable
• The convex hull of two core capacitated network design problems
• Chvátal closures for mixed integer programming problems
• Valid inequalities and facets of the capacitated plant location problem
• On the facets of the mixed-integer knapsack polyhedron
• On splittable and unsplittable flow capacitated network design arc-set polyhedra.
• Load balancing and capacity constraints in a hierarchical location model
• Lower Bounds in Lot-Sizing Models: A Polyhedral Study
• Network design arc set with variable upper bounds
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Health network mergers and hospital re-planning

This page was built for publication: The splittable flow arc set with capacity and minimum load constraints