Special issue on bilevel optimization
|
2020 |
Brotcorne, Luce |
Two-row and two-column mixed-integer presolve using hashing-based pairing methods
|
2020 |
Gemander, Patrick |
An exact approach for the multi-constraint graph partitioning problem
|
2020 |
Recalde, Diego |
Special issue on: computational discrete optimization
|
2020 |
Koster, Arie M.C.A. |
An exploratory computational analysis of dual degeneracy in mixed-integer programming
|
2020 |
Gamrath, Gerald |
A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber
|
2020 |
Ackermann, Heiner |
The complete vertex p-center problem
|
2020 |
Medrano, F. Antonio |
Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games
|
2020 |
Basilico, Nicola |
Hyper-parameter optimization for support vector machines using stochastic gradient descent and dual coordinate descent
|
2020 |
Jiang, Wei |
On conditional cuts for stochastic dual dynamic programming
|
2020 |
Ackooij, Wim van |
[Epsilon]-constraint method for bi-objective competitive facility location problem with uncertain demand scenario
|
2020 |
Beresnev, Vladimir |
Joint location and pricing within a user-optimized environment
|
2020 |
Dan, Teodora |
Computing Euclidean Steiner trees over segments
|
2020 |
Althaus, Ernst |
A robust p-Center problem under pressure to locate shelters in wildfire context
|
2020 |
Demange, Marc |
A distributionally robust optimization approach for two-stage facility location problems
|
2020 |
Gourtani, Arash |
A decomposition-based heuristic for large employee scheduling problems with inter-department transfers
|
2019 |
Attia, Dalia |
A polyhedral approach to the generalized minimum labeling spanning tree problem
|
2019 |
Silva, Thiago Gouveia da |
An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in Rn
|
2019 |
Santiago, Cláudio P. |
Ten years of feasibility pump, and counting
|
2019 |
Berthold, Timo |
A branch-and-cut algorithm for the target visitation problem
|
2019 |
Hildenbrandt, Achim |