![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Trivikram Dokka
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j13]Trivikram Dokka
, Marc Goerigk
:
Multi-level bottleneck assignment problems: Complexity and sparsity-exploiting formulations. Comput. Oper. Res. 154: 106213 (2023) - [j12]Ben Black
, Russell Ainslie
, Trivikram Dokka
, Christopher Kirkbride
:
Distributionally robust resource planning under binomial demand intakes. Eur. J. Oper. Res. 306(1): 227-242 (2023) - 2022
- [j11]Trivikram Dokka
, Adam N. Letchford
, M. Hasan Mansoor:
Revisiting surrogate relaxation for the multidimensional knapsack problem. Oper. Res. Lett. 50(6): 674-678 (2022) - 2021
- [j10]Martin Hughes, Marc Goerigk
, Trivikram Dokka
:
Automatic generation of algorithms for robust optimisation problems using Grammar-Guided Genetic Programming. Comput. Oper. Res. 133: 105364 (2021) - [j9]Trivikram Dokka
, Adam N. Letchford
, M. Hasan Mansoor:
On the complexity of surrogate and group relaxation for integer linear programs. Oper. Res. Lett. 49(4): 530-534 (2021) - [c7]Rahul Roy
, Trivikram Dokka
, David A. Ellis
, Esther Dudek, Paul Barnfather:
Understanding controlled EV charging impacts using scenario-based forecasting models: Poster. e-Energy 2021: 288-289 - [i7]Juncheng Li, Trivikram Dokka
, Guglielmo Lulli, Fabrizio Lacalandra:
Data-driven Heuristics for DC optimal transmission switching problem. CoRR abs/2110.08141 (2021) - 2020
- [j8]Martin Hughes, Marc Goerigk
, Trivikram Dokka
:
Particle swarm metaheuristics for robust optimisation with implementation uncertainty. Comput. Oper. Res. 122: 104998 (2020) - [j7]Trivikram Dokka
, Marc Goerigk
, Rahul Roy
:
Mixed uncertainty sets for robust combinatorial optimization. Optim. Lett. 14(6): 1323-1337 (2020) - [i6]Martin Hughes, Marc Goerigk, Trivikram Dokka:
Automatic Generation of Algorithms for Black-Box Robust Optimisation Problems. CoRR abs/2004.07294 (2020)
2010 – 2019
- 2019
- [j6]André B. Chassein, Trivikram Dokka
, Marc Goerigk
:
Algorithms and uncertainty sets for data-driven robust shortest path problems. Eur. J. Oper. Res. 274(2): 671-686 (2019) - [i5]Trivikram Dokka, Richlove Frimpong:
Approximate policy iteration using neural networks for storage problems. CoRR abs/1910.01895 (2019) - [i4]Trivikram Dokka, Marc Goerigk:
The Multi-level Bottleneck Assignment Problem: Complexity and Solution Methods. CoRR abs/1910.12504 (2019) - 2018
- [i3]Trivikram Dokka, Marc Goerigk, Rahul Roy:
Mixed Uncertainty Sets for Robust Combinatorial Optimization. CoRR abs/1812.04895 (2018) - 2017
- [j5]Trivikram Dokka
, Ioannis Mourtos
, Frits C. R. Spieksma
:
Fast separation for the three-index assignment problem. Math. Program. Comput. 9(1): 39-59 (2017) - [c6]Trivikram Dokka, Marc Goerigk:
An Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems. ATMOS 2017: 16:1-16:13 - [i2]Trivikram Dokka, Marc Goerigk:
An Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems. CoRR abs/1704.08470 (2017) - [i1]Trivikram Dokka, Alain B. Zemkoho
, Sonali Sen Gupta, Fabrice Talla Nobibon:
Robust toll pricing: A novel approach. CoRR abs/1712.01570 (2017) - 2016
- [j4]Trivikram Dokka
, Frits C. R. Spieksma
:
Facets of the axial three-index assignment polytope. Discret. Appl. Math. 201: 86-104 (2016) - [j3]Marin Bougeret
, Vincent Boudet, Trivikram Dokka, Guillerme Duvillié
, Rodolphe Giroudeau:
On the complexity of Wafer-to-Wafer Integration. Discret. Optim. 22: 255-269 (2016) - [c5]Trivikram Dokka, Alain B. Zemkoho
, Sonali Sen Gupta
, Fabrice Talla Nobibon:
Pricing Toll Roads under Uncertainty. ATMOS 2016: 4:1-4:14 - 2015
- [c4]Guillerme Duvillié
, Marin Bougeret
, Vincent Boudet, Trivikram Dokka
, Rodolphe Giroudeau:
On the Complexity of Wafer-to-Wafer Integration. CIAC 2015: 208-220 - 2014
- [j2]Trivikram Dokka
, Yves Crama
, Frits C. R. Spieksma
:
Multi-dimensional vector assignment problems. Discret. Optim. 14: 111-125 (2014) - 2012
- [j1]Trivikram Dokka
, Anastasia Kouvela, Frits C. R. Spieksma
:
Approximating the multi-level bottleneck assignment problem. Oper. Res. Lett. 40(4): 282-286 (2012) - [c3]Trivikram Dokka, Ioannis Mourtos
, Frits C. R. Spieksma
:
Fast Separation Algorithms for Three-Index Assignment Problems. ISCO 2012: 189-200 - [c2]Trivikram Dokka, Anastasia Kouvela, Frits C. R. Spieksma
:
Approximating the Multi-level Bottleneck Assignment Problem. WALCOM 2012: 64-75 - [c1]Trivikram Dokka
, Marin Bougeret, Vincent Boudet, Rodolphe Giroudeau, Frits C. R. Spieksma
:
Approximation Algorithms for the Wafer to Wafer Integration Problem. WAOA 2012: 286-297
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint