Structural investigation of piecewise linearized network flow problems

DOI10.1137/15M1006751MaRDI QIDQ2954170zbMATH OpenFDO

Authors F. Liers, Maximilian Merkert

Publication date 12 January 2017

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

Full work available at URL https://doi.org/10.1137/15M1006751

zbMATH Keywords

combinatorial optimizationpiecewise linear functionsnetwork flow problemscomplete description

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1795722
• Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
• scientific article; zbMATH DE number 1195629
• A combined matheuristic for the piecewise linear multicommodity network flow problem
• LP extreme points and cuts for the fixed-charge network design problem

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
• Approximating separable nonlinear functions via mixed zero-one programs
• Edmonds polytopes and a hierarchy of combinatorial problems
• Geometric algorithms and combinatorial optimization
• Locally ideal formulations for piecewise linear functions with indicator variables
• Mixed integer linear programming formulation techniques
• Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
• Modelling with integer variables
• On the Solution of Discrete Programming Problems
• On the facial structure of set packing polyhedra
• Projected Chvátal-Gomory cuts for mixed integer linear programs
• Statistical mechanics of complex networks
• The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
• The strong perfect graph theorem
• Using Piecewise Linear Functions for Solving MINLPs
• Validation of nominations in gas network optimization: models, methods, and solutions

Cited in

(16)

• Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
• The non-stop disjoint trajectories problem
• Efficient reformulation and solution of a nonlinear PDE-controlled flow network model
• Maximum Flow Networks for Stability Analysis of LEGO®Structures
• Subdivision schemes, network flows and linear optimization
• A bilinear relaxation based algorithm for concave piecewise linear network flow problems
• Piecewise-linear networks with multimode service strategies
• Staircase compatibility and its applications in scheduling and piecewise linearization
• Arc flow formulations based on dynamic programming: theoretical foundations and applications
• A simplex algorithm for network flow problems with piecewise linear fractional objective function
• Energy-efficient timetabling in a German underground system
• The clique problem with multiple-choice constraints under a cycle-free dependency graph
• A recognition problem in converting linear programming to network flow models
• On recognizing staircase compatibility
• Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph

Describes a project that uses

Uses Software

• Gurobi

This page was built for publication: Structural investigation of piecewise linearized network flow problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2954170)