Staircase compatibility and its applications in scheduling and piecewise linearization
DOI10.1016/J.DISOPT.2018.04.001zbMATH Open1474.90370OpenAlexW2883706988WikidataQ129482248 ScholiaQ129482248MaRDI QIDQ1662653FDOQ1662653
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
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
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)
Cites Work
- Title not available (Why is that?)
- Decomposition of regular matroids
- Title not available (Why is that?)
- Modelling with integer variables
- On project scheduling with irregular starting time costs
- Using Piecewise Linear Functions for Solving MINLPs
- On the Solution of Discrete Programming Problems
- Approximating separable nonlinear functions via mixed zero-one programs
- Validation of nominations in gas network optimization: models, methods, and solutions
- Evaluating Gas Network Capacities
- Title not available (Why is that?)
- Mixed integer linear programming formulation techniques
- Staircase Matrices and Systems
- Structural Investigation of Piecewise Linearized Network Flow Problems
Cited In (8)
- The non-stop disjoint trajectories problem
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints
- EETTlib—Energy‐efficient train timetabling library
- Energy-efficient timetabling in a German underground system
- Set characterizations and convex extensions for geometric convex-hull proofs
- The clique problem with multiple-choice constraints under a cycle-free dependency graph
- On recognizing staircase compatibility
- Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph
Uses Software
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)
