Semi-continuous network flow problems
The authors consider network flow problems in which some variables are semi-continuous, i.e. take values in a set of the form \(\{0\} \cup [l,u]\) for some \(0 \leq l \leq u\). They define the semi-continuous inflow set \(S(t,h)\), which arises as a substructure in general semi-continuous network flow problems. They show that optimizing a linear function over \(S(t,h)\) is NP-hard, even if \(l=0\) and present some basic polyhedral results, such as full dimensionality of \(S(t,h)\) and facet defining inequalities for the polyhedron \(conv(S(t,h))\). For the sepcial cases of \(t=0\) and \(h=0\), they provide complete descriptions of the convex hull. Finally, they consider a semi-continuous transportation problem, for which they investigate complexity questions. They present numerical results that show the effectiveness of the polyhedral results on randomly generated instances of this problem.
- A polyhedral study of the cardinality constrained knapsack problem
- A polyhedral study of the semi-continuous knapsack problem
- Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables
- Combined strategic and operational planning -- an MILP success story in chemical industry
- Computational study of a family of mixed-integer quadratic programming problems
- Cook, Kannan and Schrijver's example revisited
- Disjunctive Programming
- Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis
- Graph Theory and Integer Programming
- Integer Programming and Combinatorial Optimization
- Large-Scale Portfolio Optimization
- Optimal planning in large multi-site production networks
- The split closure of a strictly convex body
- A continuous analog of Ford-Fulkerson flows in networks and its application to a problem of Rota
- On solving two-stage distributionally robust disjunctive programs with a general ambiguity set
- Relaxations of discrete sets with semicontinuous variables
- Lot sizing with minimum order quantity
- scientific article; zbMATH DE number 6938044 (Why is no real title available?)
- A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
This page was built for publication: Semi-continuous network flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248765)
