Structural Investigation of Piecewise Linearized Network Flow Problems

DOI10.1137/15M1006751zbMath1353.05057MaRDI QIDQ2954170

Frauke Liers, Maximilian Merkert

Publication date: 12 January 2017

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

zbMATH Keywords

combinatorial optimizationpiecewise linear functionsnetwork flow problemscomplete description

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Flows in graphs (05C21)

Related Items

Staircase compatibility and its applications in scheduling and piecewise linearization, The clique problem with multiple-choice constraints under a cycle-free dependency graph, Energy-efficient timetabling in a German underground system, On recognizing staircase compatibility, Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
• The strong perfect graph theorem
• Geometric algorithms and combinatorial optimization
• Approximating separable nonlinear functions via mixed zero-one programs
• Locally ideal formulations for piecewise linear functions with indicator variables
• Projected Chvátal-Gomory cuts for mixed integer linear programs
• Edmonds polytopes and a hierarchy of combinatorial problems
• Mixed Integer Linear Programming Formulation Techniques
• Using Piecewise Linear Functions for Solving MINLPs
• Validation of nominations in gas network optimization: models, methods, and solutions
• Statistical mechanics of complex networks
• Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
• Modelling with integer variables
• On the Solution of Discrete Programming Problems
• A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
• On the facial structure of set packing polyhedra