On the maximum quadratic assignment problem

von Nagarajan, Viswanath
Veröffentlicht in Mathematics of operations research (2009)

Tight bounds for permutation flow shop scheduling

von Nagarajan, Viswanath
Veröffentlicht in Mathematics of operations research (2009)

Online Generalized Network Design under (Dis)Economies of Scale

von Nagarajan, Viswanath
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 4 of 4 (2021)

Approximating sparse covering integer programs online

von Gupta, Anupam
Veröffentlicht in Mathematics of operations research (2014)

Exact train pathing

von Nagarajan, Viswanath
Veröffentlicht in Journal of scheduling (2008)

Simpler analysis of LP extreme points for traveling salesman and survivable network design problems

von Nagarajan, Viswanath
Veröffentlicht in Operations research letters (2010)

An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem

von Agarwal, Arpit
Veröffentlicht in NeurIPS (36. : 2022 : New Orleans, La.; Online) 36th Conference on Neural Information Processing Systems (NeurIPS 2022 ; Volume 38 of 50 (2023)

THE POWER OF ADAPTIVITY FOR STOCHASTIC SUBMODULAR COVER

von GHUGE, ROHAN
Veröffentlicht in International Conference on Machine Learning (38. : 2021 : Online) International Conference on Machine Learning (ICML 2021 ; Part 5 of 16 (2022)

Non-adaptive Stochastic Score Classification and Explainable Halfspace Evaluation

von Ghuge, Rohan
Veröffentlicht in IPCO (23. : 2022 : Eindhoven) Integer programming and combinatorial optimization (2022)

Approximation algorithms for optimal decision trees and adaptive TSP problems

von Gupta, Anupam
Veröffentlicht in Mathematics of operations research (2017)

Approximation algorithms for VRP with stochastic demands

von Gupta, Anupam
Veröffentlicht in Operations research (2012)

The Euclidean k-supplier problem

von Nagarajan, Viswanath
Veröffentlicht in Mathematics of operations research (2020)

Adaptive submodular ranking and routing

von Navidi, Fatemeh
Veröffentlicht in Operations research (2020)

An approximation algorithm for vehicle routing with compatibility constraints

von Yu, Miao
Veröffentlicht in Operations research letters (2018)

An improved approximation algorithm for requirement cut

von Gupta, Anupam
Veröffentlicht in Operations research letters (2010)

On some variants of Euclidean k-supplier

von Lee, Euiwoong
Veröffentlicht in Operations research letters (2022)

Approximation algorithms for the a priori traveling repairman

von Navidi, Fatemeh
Veröffentlicht in Operations research letters (2020)

OPTIMAL DECISION TREE WITH NOISY OUTCOMES

von Jia, Su
Veröffentlicht in NeurIPS (33. : 2019 : Vancouver, British Columbia) 32nd Conference on Neural Information Processing Systems (NeurIPS 2019) ; Volume 5 of 20 (2020)

Stochastic load balancing on unrelated machines

von Gupta, Anupam
Veröffentlicht in Mathematics of operations research (2021)

Malleable scheduling for flows of jobs and applications to MapReduce

von Nagarajan, Viswanath
Veröffentlicht in Journal of scheduling (2019)