Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
Year of publication: |
2023
|
---|---|
Authors: | Baïou, Mourad ; Colares, Rafael ; Kerivin, Hervé |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 310.2023, 2 (16.10.), p. 552-565
|
Subject: | Approximation algorithms | Clustering | Robust optimization | Robustness and sensitivity analysis | Scenario reduction | Theorie | Theory | Robustes Verfahren | Robust statistics | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Sensitivitätsanalyse | Sensitivity analysis |
-
Goerigk, Marc, (2023)
-
Approximating combinatorial optimization problems with the ordered weighted averaging criterion
Chassein, André, (2020)
-
Algorithms and uncertainty sets for data-driven robust shortest path problems
Chassein, André, (2019)
- More ...
-
Separation of partition inequalities for the (1,2)-survivable network design problem
Kerivin, Hervé, (2002)
-
On a resource-constrained scheduling problem with application to distributed systems reconfiguration
Sirdey, Renaud, (2007)
-
The node-edge weighted 2-edge connected subgraph problem : linear relaxation, facets and separation
Baïou, Mourad, (2003)
- More ...