Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares (Student Abstract) | Zendy

Noah Rubin | Zendy; Curtis Bright | Zendy; Brett Stevens | Zendy; Kevin K. H. Cheung | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares (Student Abstract)

Author(s) -

Noah Rubin,

Curtis Bright,

Brett Stevens,

Kevin K. H. Cheung

Publication year - 2022

Publication title -

proceedings of the aaai conference on artificial intelligence

Language(s) - English

Resource type - Journals

eISSN - 2374-3468

pISSN - 2159-5399

DOI - 10.1609/aaai.v36i11.21655

Subject(s) - integer programming , constraint (computer aided design) , integer (computer science) , constraint programming , computer science , latin square , constraint satisfaction problem , order (exchange) , orthogonal array , mathematics , scheme (mathematics) , mathematical optimization , programming language , artificial intelligence , mathematical analysis , rumen , chemistry , geometry , food science , finance , taguchi methods , probabilistic logic , stochastic programming , fermentation , economics , machine learning

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research