A greedy algorithm for the social golfer and the Oberwolfach problem (Q2670589): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CSPLib / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3199645543 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2007.10704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Arbitrary Graphs of Maximum Degree Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(H\)-factors in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Oberwolfach problem and factors of uniform odd length cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle systems in the complete bipartite graph minus a one-factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable coloring and the maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bandwidth theorem for approximate decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of independent circuits in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4053697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the 1-factorization and Hamilton Decomposition Conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Social Golfers Locally / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On circuits in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A business dinner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution of the Oberwolfach problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On resolvable designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Restricted Two-Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness of a generalized matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of General Graph Factor Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packings by cliques and by finite families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of \(C_ k\)-factorizations of \(K_{2n}-F\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A refinement of a result of Corrádi and Hajnal / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for equitable coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling social golfer problem: the case of the Volleyball Nations League / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equipartite Oberwolfach problem with uniform tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round robin scheduling -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5181380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectrum of maximal sets of one-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Premature sets of 1-factors or how not to schedule round robin tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Merging Combinatorial Design and Optimization: the Oberwolfach Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective greedy heuristic for the social golfer problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved SAT formulation for the social golfer problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Erdős-Faudree conjecture on quadrilaterals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint 5-cycles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial and computational aspects of graph packing and graph decomposition / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:22, 28 July 2024

scientific article
Language Label Description Also known as
English
A greedy algorithm for the social golfer and the Oberwolfach problem
scientific article

    Statements

    A greedy algorithm for the social golfer and the Oberwolfach problem (English)
    0 references
    0 references
    0 references
    0 references
    11 March 2022
    0 references
    OR in sports
    0 references
    graph theory
    0 references
    combinatorial optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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