An algorithm for large scale 0-1 integer programming with application to airline crew scheduling

DOI10.1007/BF02099703zbMath0831.90087OpenAlexW1971978410MaRDI QIDQ1897393

Dag Wedelin

Publication date: 27 August 1995

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02099703

zbMATH Keywords

approximation algorithmlarge 0-1 integer programmingunconstrained nonlinear problem

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Boolean programming (90C09)

Related Items (27)

Airline crew scheduling from planning to operations ⋮ A new two-stage heuristic for the recreational vehicle scheduling problem ⋮ Algorithms for railway crew management ⋮ A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems ⋮ Duty-period-based network model for crew rescheduling in European airlines ⋮ The design of a 0-1 integer optimizer and its application in the Carmen system ⋮ A multi-start randomized heuristic for real-life crew rostering problems in airlines with work-balancing goals ⋮ Matheuristics: survey and synthesis ⋮ Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs ⋮ A dynamic programming based algorithm for the crew scheduling problem. ⋮ Algorithms for large scale shift minimisation personnel task scheduling problems ⋮ Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems ⋮ Staff scheduling and rostering: a review of applications, methods and models. ⋮ Cost Propagation – Numerical Propagation for Optimization Problems ⋮ A new modeling and solution approach for the set-partitioning problem ⋮ Solving Large Scale Optimization Problems in the Transportation Industry and Beyond Through Column Generation ⋮ A heuristic algorithm for the set covering problem ⋮ A dual ascent procedure for the set partitioning problem ⋮ An efficient Lagrangean heuristic for rental vehicle scheduling ⋮ Combined bus and driver scheduling ⋮ Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid ⋮ Spherical classification of data, a new rule-based learning method ⋮ A resource constrained scheduling problem with multiple independent producers and a single linking constraint: a coal supply chain example ⋮ Heuristics for the variable sized bin-packing problem ⋮ VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH ⋮ Computational experience with approximation algorithms for the set covering problem ⋮ Airline crew scheduling: state-of-the-art

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new approach for crew pairing problems by column generation with an application to air transportation
• A probabilistic heuristic for a computationally difficult set covering problem
• An interior point algorithm to solve computationally difficult set covering problems
• Nonserial dynamic programming
• A note on some computationally difficult set covering problems
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• A Greedy Heuristic for the Set-Covering Problem

This page was built for publication: An algorithm for large scale 0-1 integer programming with application to airline crew scheduling