Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm (Q342392): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Cliquer / rank
 
Normal rank
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.1016/j.cor.2016.02.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2288234518 / 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: 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: 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
Property / cites work
 
Property / cites work: Fair referee assignments for professional football leagues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round robin scheduling -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling in sports: an annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the traveling umpire problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path inequalities for the vehicle routing problem with time windows / rank
 
Normal rank

Latest revision as of 00:01, 13 July 2024

scientific article
Language Label Description Also known as
English
Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm
scientific article

    Statements

    Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    sports scheduling
    0 references
    traveling umpire problem
    0 references
    integer programming
    0 references
    branch-and-cut
    0 references
    OR in sports
    0 references

    Identifiers