Abstract
We describe the design of an optimizer for 0–1 integer programming aimed at solving large problems. The algorithm is based on very simple operations giving it a low complexity, and we show that for large set covering problems it can produce very good solutions compared to other methods. This is the only optimizer in the Carmen system for airline crew scheduling, used by several major European airlines, and we discuss how it has affected the overall design and success of this system.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
