The quadratic shortest path problem : complexity, approximability, and solution methods
| Year of publication: |
16 July 2018
|
|---|---|
| Authors: | Rostami, Borzou ; Chassein, André ; Hopf, Michael ; Frey, Davide ; Buchheim, Christoph ; Malucelli, Federico ; Goerigk, Marc |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 268.2018, 2 (16.7.), p. 473-485
|
| Subject: | Combinatorial optimization | Shortest path problem | Quadratic 0-1 optimization | Computational complexity | Branch-and-Bound | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Jin, Bo, (2023)
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
-
Exact solution algorithms for the maximum flow problem with additional conflict constraints
Şuvak, Zeynep, (2020)
- More ...
-
Variable-sized uncertainty and inverse problems in robust optimization
Chassein, André, (2018)
-
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
Chassein, André, (2019)
-
Approximating combinatorial optimization problems with the ordered weighted averaging criterion
Chassein, André, (2020)
- More ...