Solving large set covering problems for crew scheduling

DOI10.1007/BF02568529zbMath0887.90142MaRDI QIDQ1367686

Enrico Faggioli, Ferdinando Pezzella

Publication date: 6 May 1998

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

optimizationLagrangian relaxationcrew schedulingset-covering

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Enhancing an algorithm for set covering problems
• A genetic algorithm for the set covering problem
• A Lagrangian-based heuristic for large-scale set covering problems
• Algorithms for large scale set covering problems
• An algorithm for set covering problem
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• A Greedy Heuristic for the Set-Covering Problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems