Math. Oper. Res

457 papers375 directions

Papers by Year

2026 24
2025 25
2024 40
2023 41
2022 44
2021 37
2020 35
2019 38
2018 28
2017 32
2016 28
2015 22
2014 22
2013 11
2012 8
2011 10
2010 13
2009 16
2008 8
2007 8
2006 9
2005 7
2004 5
2003 3
2002 4
2000 2
1999 4
1998 1
1997 3
1996 1
1995 2
1994 2
1993 3
1992 3
1991 2
1988 1
1987 1

Top Research Directions

Research directions most represented by papers from this venue.

Overcoming the Convexity Constraint in Modern Optimization 13
The Empirical Validation Gap 12
From Fractional Solutions to Discrete Decisions 7
Aligning Selfish Routing with Socially Optimal Traffic Flow 6
Strategyproof Resource Allocation Without Money 5
Optimization over Non-Smooth and Non-Convex Landscapes 5
Analyzing Systems with Non Exponential Service Times 4
Symmetry Reduction for High Dimensional Optimization 4
Overcoming the Static Pricing Assumption 4
Convergence Guarantees for Inexact Subproblem Optimization 4
Tractable Convex Reformulations for Robust Optimization 4
Scaling Bandit Learning to Large Action Spaces 4
Multi-Agent Learning Under Bandit Feedback 4
Convergence Rates of Mean Field Approximations 4
Calibrating Uncertainty Set Radii for Robust Optimization 4

Top Authors

AuthorPapers
Maxim Sviridenko12
Jose Correa11
Anupam Gupta8
Jean B. Lasserre8
Shie Mannor8
Viswanath Nagarajan8
Jerome Bolte7
László A. Végh7
Roberto Cominetti7
Asuman E. Ozdaglar6
Christos Papadimitriou6
David Gamarnik6
Max Klimm6
Niv Buchbinder6
Adam Wierman5
Amin Saberi5
Marco Molinaro5
Moshe Tennenholtz5
Alberto Del Pia4
Anthony Man-Cho So4

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
The Cutting Plane Method is Polynomial for Perfect Matchings2016
Unified Algorithms for Online Learning and Competitive Analysis2016
Unrelated Machine Scheduling with Stochastic Processing Times2016
Zero-Sum Polymatrix Games: A Generalization of Minmax2016
Affine Point Processes: Approximation and Efficient Simulation2015
Approximation Limits of Linear Programs (Beyond Hierarchies)2015
A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming2015
Cut-Generating Functions and S-Free Sets2015
Definable Zero-Sum Stochastic Games2015
Facility Location with Matroid or Knapsack Constraints2015
From Cost Sharing Mechanisms to Online Selection Problems2015
On a Unified Framework for Approachability with Full or Partial Monitoring2015
Penalty-Regulated Dynamics and Robust Learning Procedures in Games2015
Running Errands in Time: Approximation Algorithms for Stochastic Orienteering2015
Sharp Thresholds for Monotone Non-Boolean Functions and Social Choice Theory2015
Stochastic Billiards for Sampling from the Boundary of a Convex Set2015
The Linear Complementarity Problems with a Few Variables per Constraint2015
Tight Approximations of Dynamic Risk Measures2015
A Block Successive Upper Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization2014
A Note on Appointment Scheduling with Piecewise Linear Cost Functions2014
Approximating Sparse Covering Integer Programs Online2014
A Tight 2-Approximation for Preemptive Stochastic Scheduling2014
Concave Generalized Flows with Applications to Market Equilibria2014
Correlation Decay in Random Decision Networks2014
Hardness and Approximation Results for L-Ball Constrained Homogeneous Polynomial Optimization Problems.p2014
Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems2014
Learning to Optimize via Posterior Sampling2014
Online Stochastic Matching: New Algorithms with Better Bounds2014
Opportunistic Approachability and Generalized No-Regret Problems2014
Optimal Design for Multi-Item Auctions: A Robust Optimization Approach2014
Partial Monitoring - Classification, Regret Bounds, and Algorithms2014
Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games2014
Potential Games Areto Ensure Pure Nash Equilibria in Cost Sharing Games2014
Rare-Event Simulation for Many-Server Queues2014
Regret in Online Combinatorial Optimization2014
Secretary Problems via Linear Programming2014
The Geometry of Online Packing Linear Programs2014
Truthful Generalized Assignments via Stable Matching2014
An Approximation Algorithm for the Bipartite Traveling Tournament Problem2013
Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization2013
Inverse Polynomial Optimization2013
Lifts of Convex Sets and Cone Factorizations2013
Opinion Fluctuations and Disagreement in Social Networks2013
Optimal Sampling of Overflow Paths in Jackson Networks2013
Robust Markov Decision Processes2013
Weak Recovery Conditions from Graph Partitioning Bounds and Order Statistics2013
A Distributional Interpretation of Robust Optimization2012
Comparing Markov Chains: Aggregation and Precedence Relations Applied to Sets of States, with Applications to Assemble-to-Order Systems2012
Distributionally Robust Markov Decision Processes2012
Online Stochastic Matching: Online Actions Based on Offline Statistics2012

« prev Page 7/10 next »