The design of a 0-1 integer optimizer and its application in the Carmen system

DOI10.1016/0377-2217(95)00243-XzbMath0915.90210MaRDI QIDQ1390346

Dag Wedelin

Publication date: 7 July 1999

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

zbMATH Keywords

airline crew schedulinglarge set covering problems

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)

Related Items (3)

A dynamic programming based algorithm for the crew scheduling problem. ⋮ Cost Propagation – Numerical Propagation for Optimization Problems ⋮ An efficient Lagrangean heuristic for rental vehicle scheduling

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
• An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
• Contribution to 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
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms

This page was built for publication: The design of a 0-1 integer optimizer and its application in the Carmen system