Staircase compatibility and its applications in scheduling and piecewise linearization

DOI10.1016/J.DISOPT.2018.04.001MaRDI QIDQ1662653zbMATH OpenOpenAlexWikidataFDO

Authors Andreas Bärmann, Thorsten Gellermann, Maximilian Merkert, Oskar Schneider

Publication date 20 August 2018

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2018.04.001

zbMATH Keywords

clique problem with multiple-choice constraintspiecewise linearizationschedulingstaircase compatibilitytotal unimodularity

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• On recognizing staircase compatibility
• The clique problem with multiple-choice constraints under a cycle-free dependency graph
• Solving the staircase cost facility location problem with decomposition and piecewise linearization
• Dual nested decomposition of staircase linear programs
• Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph

Cites work

• Approximating separable nonlinear functions via mixed zero-one programs
• Decomposition of regular matroids
• Evaluating Gas Network Capacities
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 3185974 (Why is no real title available?)
• Mixed integer linear programming formulation techniques
• Modelling with integer variables
• On project scheduling with irregular starting time costs
• On the Solution of Discrete Programming Problems
• Staircase Matrices and Systems
• Structural investigation of piecewise linearized network flow problems
• Using Piecewise Linear Functions for Solving MINLPs
• Validation of nominations in gas network optimization: models, methods, and solutions

Cited in

(8)

• Energy-efficient timetabling in a German underground system
• Set characterizations and convex extensions for geometric convex-hull proofs
• On recognizing staircase compatibility
• Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph
• The clique problem with multiple-choice constraints under a cycle-free dependency graph
• The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints
• EETTlib—Energy‐efficient train timetabling library
• The non-stop disjoint trajectories problem

Describes a project that uses

Uses Software

• Gurobi

This page was built for publication: Staircase compatibility and its applications in scheduling and piecewise linearization

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