Staircase compatibility and its applications in scheduling and piecewise linearization
DOI10.1016/j.disopt.2018.04.001zbMath1474.90370OpenAlexW2883706988WikidataQ129482248 ScholiaQ129482248MaRDI QIDQ1662653
Andreas Bärmann, Maximilian Merkert, Thorsten Gellermann, 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
schedulingtotal unimodularitypiecewise linearizationclique problem with multiple-choice constraintsstaircase compatibility
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items (7)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposition of regular matroids
- Approximating separable nonlinear functions via mixed zero-one programs
- Mixed Integer Linear Programming Formulation Techniques
- Using Piecewise Linear Functions for Solving MINLPs
- Evaluating Gas Network Capacities
- Validation of nominations in gas network optimization: models, methods, and solutions
- Structural Investigation of Piecewise Linearized Network Flow Problems
- Modelling with integer variables
- On the Solution of Discrete Programming Problems
- Staircase Matrices and Systems
- On project scheduling with irregular starting time costs
This page was built for publication: Staircase compatibility and its applications in scheduling and piecewise linearization