Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem (Q322545): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method of Solving Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Assignment and Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders' cuts guided large neighborhood search for the traveling umpire problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and local search based methods for the traveling umpire problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two exact algorithms for the traveling umpire problem / rank
 
Normal rank

Revision as of 16:07, 12 July 2024

scientific article
Language Label Description Also known as
English
Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem
scientific article

    Statements

    Identifiers

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