An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
From MaRDI portal
Publication:1897393
Recommendations
Cites work
- A Greedy Heuristic for the Set-Covering Problem
- A new approach for crew pairing problems by column generation with an application to air transportation
- A note on some computationally difficult set covering problems
- A probabilistic heuristic for a computationally difficult set covering problem
- An interior point algorithm to solve computationally difficult set covering problems
- scientific article; zbMATH DE number 5164439 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3550465 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3314878 (Why is no real title available?)
- Nonserial dynamic programming
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
Cited in
(30)- Heuristics for the variable sized bin-packing problem
- Computational experience with approximation algorithms for the set covering problem
- Algorithms for railway crew management
- The design of a 0-1 integer optimizer and its application in the Carmen system
- A dynamic programming based algorithm for the crew scheduling problem.
- Staff scheduling and rostering: a review of applications, methods and models.
- A new two-stage heuristic for the recreational vehicle scheduling problem
- A multi-start randomized heuristic for real-life crew rostering problems in airlines with work-balancing goals
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
- A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
- Bregman proximal relaxation of large-scale 0-1 problems
- 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 new modeling and solution approach for the set-partitioning problem
- A resource constrained scheduling problem with multiple independent producers and a single linking constraint: a coal supply chain example
- Airline crew scheduling from planning to operations
- Solving large scale optimization problems in the transportation industry and beyond through column generation
- VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH
- scientific article; zbMATH DE number 1070393 (Why is no real title available?)
- Algorithms for large scale shift minimisation personnel task scheduling problems
- Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems
- A heuristic algorithm for the set covering problem
- Cost Propagation – Numerical Propagation for Optimization Problems
- Combined bus and driver scheduling
- Matheuristics: survey and synthesis
- Introducing covering problems for the electronic wafer test
- An efficient Lagrangean heuristic for rental vehicle scheduling
- Airline crew scheduling: state-of-the-art
- Duty-period-based network model for crew rescheduling in European airlines
- A dual ascent procedure for the set partitioning problem
This page was built for publication: An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897393)
