Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling

DOI10.1016/j.ejor.2017.05.047zbMath1380.90191OpenAlexW2621304889MaRDI QIDQ1694842

Frédéric Quesnel, Issmail El Hallaoui, Samuel Rosat, François Soumis

Publication date: 6 February 2018

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2017.05.047

zbMATH Keywords

integer programmingnormalizationprimal algorithmsaircrew schedulingintegral simplex

Mathematics Subject Classification ID

Integer programming (90C10) Fractional programming (90C32) Deterministic scheduling theory in operations research (90B35)

Related Items

Distributed integral column generation for set partitioning problems ⋮ Vector Space Decomposition for Solving Large-Scale Linear Programs

Uses Software

• ISUD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• All-integer column generation for set partitioning: basic principles and extensions
• Influence of the normalization constraint on the integral simplex using decomposition
• Column generation in the integral simplex method
• Crew pairing at Air France
• An integral simplex algorithm for solving combinatorial optimization problems
• Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis
• Integral Simplex Using Decomposition for the Set Partitioning Problem
• An Improved Primal Simplex Algorithm for Degenerate Linear Programs
• On the Set-Covering Problem: II. An Algorithm for Set Partitioning
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
• 0/1-Integer programming: Optimization and Augmentation are equivalent

This page was built for publication: Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling