Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

Research Article

Equivalent Representations of Set Functions

Pages:157–178

Published Online:May 1, 2000

https://doi.org/10.1287/moor.25.2.157.12225

Preview Abstract
Superlinear Convergence of an Interior-Point Method Despite Dependent Constraints

Pages:179–194

Published Online:May 1, 2000

https://doi.org/10.1287/moor.25.2.179.12227

Preview Abstract
A Primal-Dual Variant of the IRI-IMAI Algorithm for Linear Programming

Pages:195–213

Published Online:May 1, 2000

https://doi.org/10.1287/moor.25.2.195.12221

Preview Abstract
An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions

Pages:214–230

Published Online:May 1, 2000

https://doi.org/10.1287/moor.25.2.214.12222

Preview Abstract
Generic Convergence of Descent Methods in Banach Spaces

Pages:231–242

Published Online:May 1, 2000

https://doi.org/10.1287/moor.25.2.231.12226

Preview Abstract
Separation of Partition Inequalities

Pages:243–254

Published Online:May 1, 2000

https://doi.org/10.1287/moor.25.2.243.12223

Preview Abstract
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems

Pages:255–280

Published Online:May 1, 2000

https://doi.org/10.1287/moor.25.2.255.12228

Preview Abstract
Index Policies and a Novel Performance Space Structure for a Class of Generalised Branching Bandit Problems

Pages:281–297

Published Online:May 1, 2000

https://doi.org/10.1287/moor.25.2.281.12229

Preview Abstract
Majorization of Weighted Trees: A New Tool to Study Correlated Stochastic Systems

Pages:298–323

Published Online:May 1, 2000

https://doi.org/10.1287/moor.25.2.298.12224

Preview Abstract
Multimodularity, Convexity, and Optimization Properties

Pages:324–347

Published Online:May 1, 2000

https://doi.org/10.1287/moor.25.2.324.12230

Preview Abstract
Previous
Back to Top
Next
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.
Agree