A set covering approach for multi-depot train driver scheduling (Q2343986): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-013-9612-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075750279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate constraint normalization for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiroute maximum flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with general cutting planes for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on some computationally difficult set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximate Model and Solution Approach for the Long-Haul Crew Pairing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Method for the Set Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for railway crew management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Solving the Crew Rostering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3500142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms and traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large scale crew scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring relaxation induced neighborhoods to improve MIP solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crew pairing at Air France / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of personnel scheduling and rostering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Staff scheduling and rostering: a review of applications, methods and models. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2731676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Airline Crew Scheduling Problems by Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation approach for the rail crew re-scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2759914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective search space control for large and/or complex driver scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective and simple heuristic for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of a hybrid genetic algorithm to airline crew scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient heuristic for large set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a facility location algorithm to solve large set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3-flip neighborhood local search for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Airline cockpit crew scheduling / rank
 
Normal rank

Latest revision as of 02:21, 10 July 2024

scientific article
Language Label Description Also known as
English
A set covering approach for multi-depot train driver scheduling
scientific article

    Statements

    A set covering approach for multi-depot train driver scheduling (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2015
    0 references
    set covering problem
    0 references
    LP-based neighborhoods
    0 references
    matheuristic
    0 references
    tabu search
    0 references
    design of experiment
    0 references
    train drive scheduling
    0 references
    Iranian railways
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers