On recognizing staircase compatibility

DOI10.1007/s10957-022-02091-2zbMath1506.90214OpenAlexW4308502377MaRDI QIDQ2093277

Maximilian Merkert, Alexander Martin, Andreas Bärmann, Patrick Gemander

Publication date: 7 November 2022

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-022-02091-2

zbMATH Keywords

schedulingclique problemmultiple-choice constraintsstaircase structure

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (1)

EETTlib—Energy‐efficient train timetabling library

Uses Software

• NetworkX
• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• Staircase compatibility and its applications in scheduling and piecewise linearization
• Preprocessing and cutting planes with conflict graphs
• Energy-efficient timetabling in a German underground system
• The clique problem with multiple-choice constraints under a cycle-free dependency graph
• New integer linear programming models for the vertex coloring problem
• Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
• Structural Investigation of Piecewise Linearized Network Flow Problems
• Staircase Matrices and Systems
• Solving staircase linear programs by the simplex method, 1: Inversion
• Total Ordering Problem
• Solving staircase linear programs by the simplex method, 2: Pricing
• Reducibility among Combinatorial Problems

This page was built for publication: On recognizing staircase compatibility