Solving large set covering problems for crew scheduling

DOI10.1007/BF02568529MaRDI QIDQ1367686zbMATH OpenFDO

Authors F. Pezzella, Enrico Faggioli

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) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Recommendations

• A Lagrangian-based heuristic for large-scale set covering problems
• A Heuristic Method for the Set Covering Problem
• scientific article; zbMATH DE number 4121754
• Publication:4889112
• Algorithms for large scale set covering problems

Cites work

• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 4121754 (Why is no real title available?)
• A Greedy Heuristic for the Set-Covering Problem
• A Lagrangian-based heuristic for large-scale set covering problems
• A genetic algorithm for the set covering problem
• Algorithms for large scale set covering problems
• An algorithm for set covering problem
• Enhancing an algorithm for set covering problems
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• The Lagrangian Relaxation Method for Solving Integer Programming Problems

Cited in

(3)

• scientific article; zbMATH DE number 915592 (Why is no real title available?)
• A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
• A meta-heuristic with orthogonal experiment for the set covering problem

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: Solving large set covering problems for crew scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367686)