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
Generalized Poincaré-Hopf Theorem for Compact Nonsmooth Regions2007
LP Rounding Approximation Algorithms for Stochastic Network Design2007
On the Speed of Convergence of Value Iteration on Stochastic Shortest-Path Problems2007
On the Undecidability of Computing Stationary Distributions and Large Deviation Rates for Constrained Random Walks2007
Solution and Forecast Horizons for Infinite-Horizon Nonhomogeneous Markov Decision Processes2007
A Cost-Shaping Linear Program for Average-Cost Approximate Dynamic Programming with Performance Guarantees2006
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm2006
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes2006
Job Shop Scheduling with Unit Processing Times2006
Models and Algorithms for Stochastic Online Scheduling2006
Performance Loss Bounds for Approximate Value Iteration with State Aggregation2006
Regret Minimization Under Partial Monitoring2006
Simulated Annealing for Convex Optimization2006
Solving Stochastic Mathematical Programs with Complementarity Constraints Using Simulation2006
An Alternative Algorithm for Counting Lattice Points in a Convex Polytope2005
Asymptotic Behavior of Internet Congestion Controllers in a Many-Flows Regime2005
Duality and Existence of Optimal Policies in Generalized Joint Replenishment2005
Minimizing Makespan in No-Wait Job Shops2005
On the Empirical State-Action Frequencies in Markov Decision Processes Under General Policies2005
Robust Dynamic Programming2005
Single-Machine Scheduling with Precedence Constraints2005
Diffusion Approximations for a Multiclass Markovian Service System with "Guaranteed" and "Best-Effort" Service Levels2004
Efficiency Loss in a Network Resource Allocation Game2004
On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming2004
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut2004
Selfish Routing in Capacitated Networks2004
On Counting Integral Points in a Convex Rational Polytope2003
Robust Portfolio Selection Problems2003
The Empirical Bayes Envelope and Regret Minimization in Competitive Markov Decision Processes2003
A Min-Max Theorem on Feedback Vertex Sets2002
A Polyhedral Study of Integer Variable Upper Bounds2002
On Deciding Stability of Constrained Homogeneous Random Walks and Queueing Systems2002
Semidefinite Programming vs. LP Relaxations for Polynomial Programming2002
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems2000
Multimodularity, Convexity, and Optimization Properties2000
Algorithmic Aspects of the Core of Combinatorial Optimization Games1999
The Complexity of Optimal Queuing Network Control1999
The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces1999
Sensitivity Analysis of Optimization Problems Under Second Order Regular Constraints1998
Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming1997
Nearly Optimal Competitive Online Replacement Policies1997
Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem1997
A Faster Combinatorial Algorithm for the Generalized Circulation Problem1996
A Convex Analytic Framework for Ergodic Control of Semi-Markov Processes1995
On the Complexity of a Class of Projective Interior Point Methods1995
Monotone Optimal Control of Permutable GSMPs1994
On the Complexity of Cooperative Solution Concepts1994
Probabilistic Analysis of Network Flow Algorithms1993
Rearrangement, Majorization and Stochastic Scheduling1993
The Traveling Salesman Problem with Distances One and Two1993

« prev Page 9/10 next »