|
|
|
|
|
Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai and Keisuke Goto
Re-Pairis a grammar compression scheme with favorably good compression rates. The computation of Re-Pair comes with the cost of maintaining large frequency tables, which makes it hard to compute Re-Pair on large-scale data sets. As a solution for this pr...
ver más
|
|
|
|
|
|
|
|
|
Nicolas Dupin and El-Ghazali Talbi
This paper studies the hybridization of Mixed Integer Programming (MIP) with dual heuristics and machine learning techniques, to provide dual bounds for a large scale optimization problem from an industrial application. The case study is the EURO/ROADEF ...
ver más
|
|
|
|
|
|
|
|
|
D.V Lemtyuzhnikova,D.V. Kovkov
Pág. 1 - 8
We consider algorithms for solving integer optimization problems with quasi--block structure. Modern decomposition approaches are analyzed. We study Finkelstein decomposition and it variations for discovering quasi--block structure. Efficiency of local e...
ver más
|
|
|
|
|
|
|
|
|
Jiangtao Liu, Jee Eun Kang, Xuesong Zhou, Ram Pendyala
Pág. 827 - 847
The recently emerging trend of self-driving vehicles and information sharing technologies, made available by private technology vendors, starts creating a revolutionary paradigm shift in the coming years for traveler mobility applications. By considering...
ver más
|
|
|
|
|
|
|
|
|
Dimitris Bertsimas, Guglielmo Lulli, and Amedeo Odoni
Pág. 211 - 227
|
|
|
|