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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Greet vanden Berghe / rank
Normal rank
 
Property / author
 
Property / author: Greet vanden Berghe / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C57 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6636084 / rank
 
Normal rank
Property / zbMATH Keywords
 
traveling umpire problem
Property / zbMATH Keywords: traveling umpire problem / rank
 
Normal rank
Property / zbMATH Keywords
 
decomposition strategies
Property / zbMATH Keywords: decomposition strategies / rank
 
Normal rank
Property / zbMATH Keywords
 
branch-and-bound
Property / zbMATH Keywords: branch-and-bound / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1793246991 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

Latest 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