/*** ############################## # Identification of the news # ############################## # DO NOT MODIFY name: fsmp-cours-chaire date: 2019-03-15 ################ # General data # ################ # the picture address, in dokuwiki or web syntax picture = :actualites:ressources:perso-uri-zwick.jpg # the name displayed when hovering over the picture (optional) picture tag = Uri Zwick # the link to be followed when clicking on the picture (optional) picture link = # the link in the circled arrow icon (optional) extra link = https://www.sciencesmaths-paris.fr/fr/le-cours-duri-zwick-975.htm ####################### # Visibility/priority # ####################### # # This part describes when the news should be visible, and with what priority (how high in the list). # for 3 months until 2019-05-22, priority= low for 3 months until 2019-05-22, priority= normal for 3 months until 2019-05-22, priority= high # # Other intervals of priority can/have to be specified. # # As a rule of thumb: # - priority high for up to 3 days, 10 days for very important events (FOCS) (appears top of the list) # - priority normal for up to 2 or 3 weeks (appears with high probability) # - priority low for as long as one wishes (probably invisible but sometimes can be if there is sufficient space) # - priority null makes the news invisible # - priorities may change several times (e.g. high for registration and for the event) # - this syntax can also be used for changing pictures, links, ... # # The syntax is the following # from DATE until DATE, priority= PRIORITY # from DATE for DURATION, priority= PRIORITY # for DURATION until DATE, priority= PRIORITY # # PRIORITY: high | normal | low | null # # DATE: # NUMBER MONTH NUMBER (e.g. 22 June 2018) # ???-??-?? (e.g. 2018-06-22) # # DURATION: # NUMBER (day|days|week|weeks|month|months|year|years) ########## # Notion # ########## # if one wants to have a notion (a small text that unravels when clicked and is used to highlight a concept) # notion = Linear programming notion text = {Linear programming is a technique for the optimization of a linear function, subject to linear equality and linear inequality constraints. A linear programming algorithm finds a point in the polyhedron of feasible solutions satisfying those constrains, where this function has the smallest (or largest) value. Linear programming is widely used in industries, including transportation, energy, telecommunications, and manufacturing, for diverse types of tasks such as planning, routing, scheduling, assignment, and design.} #################### # TEXT OF THE NEWS # #################### ***/ **From March 20th to May 22nd, Uri Zwick** (Univ. of Tel Aviv) will give a series of **7 courses** related to his [[https://www.sciencesmaths-paris.fr/fr/laureats-chaires-fsmp-188.htm|FSMP Chaire of Excellence]] on the topic of [[https://www.sciencesmaths-paris.fr/fr/le-cours-duri-zwick-975.htm|Games on Graphs and Linear Programming Abstractions]] each **Wednesday 2:15pm - 4:15pm at IRIF, room 3052**.