On the integer properties of scheduling set partitioning models

DOI10.1016/0377-2217(88)90233-0zbMath0639.90072OpenAlexW2093939165MaRDI QIDQ1100095

J. C. Falkner, David M. Ryan

Publication date: 1988

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90233-0

zbMATH Keywords

dimensionality reductionimplicit constraintsmassive set partitioning zero-one integer programmes

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Generating, scheduling and rostering of shift crew-duties: applications at the Hong Kong international airport, Integer programming methods for large-scale practical classroom assignment problems, Investment in electricity networks with transmission switching, A Nested Cross Decomposition Algorithm for Power System Capacity Expansion with Multiscale Uncertainties, A comparison of stochastic programming and bi-objective optimisation approaches to robust airline crew scheduling, Enhancing an algorithm for set covering problems, An integer programming approach to generating airline crew pairings, A goal programming model for crew duties generation, Complementary column generation and bounding approaches for set partitioning formulations, A practical anti-cycling procedure for linearly constrained optimization, Aircrew schedule generation using repeated matching, The train driver recovery problem-a set partitioning based model and solution method, A concurrent processing framework for the set partitioning problem, A set partitioning heuristic for the generalized assignment problem, Airline crew scheduling: state-of-the-art

Cites Work

• Unnamed Item
• Unnamed Item
• On the solution of highly degenerate linear programmes
• A Dual Heuristic for Vehicle Scheduling
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
• An Integer Programming Approach to the Vehicle Scheduling Problem
• Perfect zero–one matrices
• A Technique for Resolving Degeneracy in Linear Programming
• Balanced matrices