www.zib.de/news/team-wi...
www.zib.de/news/team-wi...
Also congratulations to Dahye Han and Matheus Ota for their honorable mentions at the poster competition.
Also congratulations to Dahye Han and Matheus Ota for their honorable mentions at the poster competition.
I will keep a veil of mystery here, since this is work still in progress 😉
I will keep a veil of mystery here, since this is work still in progress 😉
1/N
1/N
1/N
1/N
1/3
1/3
1/N
1/N
1/N
1/N
There is a result that reframes this problem as a mixed-integer linear program. However, for a problem as simple as a knapsack with 50 items, CPLEX could not solve it in one hour.
1/N
There is a result that reframes this problem as a mixed-integer linear program. However, for a problem as simple as a knapsack with 50 items, CPLEX could not solve it in one hour.
1/N
One thing I didn’t known is that chance-constrained linear problems have a feasible set consisting of a possibility nonconvex set based on the union of exponential polyhedra.
1/N
One thing I didn’t known is that chance-constrained linear problems have a feasible set consisting of a possibility nonconvex set based on the union of exponential polyhedra.
1/N
The winners this year are a team from the Zuse Institute Berlin, represented by Gioni Mexi, who presents their approach based on branch-and-bound with Frank-Wolfe.
The winners this year are a team from the Zuse Institute Berlin, represented by Gioni Mexi, who presents their approach based on branch-and-bound with Frank-Wolfe.
See below a summary of the same talk as presented last month in Montreal.
See below a summary of the same talk as presented last month in Montreal.
1/N
1/N
1/N
1/N
1/3
1/3
Here is a summary of an earlier version of this talk presented at the INFORMS Computing Society conference in March.
Here is a summary of an earlier version of this talk presented at the INFORMS Computing Society conference in March.
1/2
1/2