A Lagrangian-based heuristic for large-scale set covering problems (Q1290617): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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 new approach for crew pairing problems by column generation with an application to air transportation / 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: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic heuristic for a computationally difficult set covering problem / 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: Q4735035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01581106 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091836882 / rank
 
Normal rank

Latest revision as of 08:26, 30 July 2024

scientific article
Language Label Description Also known as
English
A Lagrangian-based heuristic for large-scale set covering problems
scientific article

    Statements

    A Lagrangian-based heuristic for large-scale set covering problems (English)
    0 references
    0 references
    0 references
    0 references
    5 September 1999
    0 references
    primal-dual Lagrangian
    0 references
    subgradient algorithms
    0 references
    0-1 programming
    0 references
    approximate solutions
    0 references
    railways
    0 references
    Italian railways
    0 references
    Lagrangian-based heuristic
    0 references
    large-scale set-covering problems
    0 references
    crew-scheduling
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references