Scheduling a Bridge Club (A Case Study in Discrete Optimization)

DOI10.2307/2691356MaRDI QIDQ4013185zbMATH OpenOpenAlexFDO

Authors Bruce Elenbogen, Bruce Maxim

Publication date 27 September 1992

Full work available at URL https://doi.org/10.2307/2691356

zbMATH Keywords

annealed searchbranch-and- boundgreedy algorithmpatially balanced incomplete block designsteepest descent

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Generalized resolution search
• A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem
• scientific article; zbMATH DE number 49948
• scientific article; zbMATH DE number 898418
• A mathematical programming approach to the construction of BIBDs

Cited in

(3)

• A family of resolvable regular graph designs
• Designs, geometry, and a golfer's dilemma
• Constructing difference families through an optimization approach: Six new BIBDs

This page was built for publication: Scheduling a Bridge Club (A Case Study in Discrete Optimization)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013185)