VIDEO DOI: https://doi.org/10.48448/es86-1b33

technical paper

ECAI 2020

August 31, 2020

Live on Underline

Branch Location Problems with Maximum Satisfiability

Please log in to leave a comment

Downloads

Transcript English (automatic)

Next from ECAI 2020

Simplifying Graph Attention Networks with Source-Target Separation
technical paper

Simplifying Graph Attention Networks with Source-Target Separation

ECAI 2020

Hantao Guo
Hantao Guo

31 August 2020

Similar lecture

False-Name-Proof Facility Location on Discrete Structures
technical paper

False-Name-Proof Facility Location on Discrete Structures

ECAI 2020

Taiki Todo
Taiki Todo

01 September 2020

Stay up to date with the latest Underline news!

Select topic of interest (you can select more than one)

PRESENTATIONS

  • All Lectures
  • For Librarians
  • Resource Center
  • Free Trial
Underline Science, Inc.
1216 Broadway, 2nd Floor, New York, NY 10001, USA

© 2023 Underline - All rights reserved