Research Article

Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders

Pages:1–13

Published Online:January 27, 2010

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

Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions

Pages:14–26

Published Online:December 8, 2009

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

Weak Differentiability of Product Measures

Pages:27–51

Published Online:December 8, 2009

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

Accuracy Certificates for Computational Problems with Convex Structure

Pages:52–78

Published Online:December 29, 2009

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

A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems

Pages:79–101

Published Online:December 8, 2009

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

On Sums of Conditionally Independent Subexponential Random Variables

Pages:102–119

Published Online:December 8, 2009

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

Variational Conditions Under the Constant Rank Constraint Qualification

Pages:120–139

Published Online:January 27, 2010

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

On the One-Dimensional Optimal Switching Problem

Pages:140–159

Published Online:January 27, 2010

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

Memory Loss Property for Products of Random Matrices in the Max-Plus Algebra

Pages:160–172

Published Online:January 27, 2010

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

Sharing the Cost of a Capacity Network

Pages:173–192

Published Online:January 27, 2010

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

Subgame Perfection in Positive Recursive Games with Perfect Information

Pages:193–207

Published Online:January 27, 2010

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

Bounding Probability of Small Deviation: A Fourth Moment Approach

Pages:208–232

Published Online:February 1, 2010

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

An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets

Pages:233–256

Published Online:February 1, 2010

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

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.