On the Power of Linear Programming for K-Means Clustering

Published Online:May 19, 2026

https://doi.org/10.1287/ijoo.2025.0065

Mixed-Integer Programming for a Class of Robust Submodular Maximization Problems

Published Online:May 15, 2026

https://doi.org/10.1287/ijoo.2023.0016

Sketching Stochastic Valuation Functions

Published Online:April 6, 2026

https://doi.org/10.1287/ijoo.2024.0039

Partial Identification with Proxy of Latent Confoundings via Sum-of-Ratios Fractional Programming

Published Online:March 26, 2026

https://doi.org/10.1287/ijoo.2023.0008

A Randomized Block-Coordinate Primal-Dual Method for Large-Scale Stochastic Saddle Point Problems

Published Online:February 25, 2026

https://doi.org/10.1287/ijoo.2024.0056

Determining Sharp Proximity Bounds for Low Row Rank and Δ-Modularity

Published Online:February 12, 2026

https://doi.org/10.1287/ijoo.2025.0068

A Bilevel Optimization Approach for Computing Synthetic Data to Mitigate Unfairness in Collaborative Machine Learning

Published Online:January 29, 2026

https://doi.org/10.1287/ijoo.2025.0091

Fair and Accurate Regression: Strong Formulations and Algorithms

Published Online:January 7, 2026

https://doi.org/10.1287/ijoo.2025.0063

Open Access
Tightening the Difference-of-Convex Formulation for the Piecewise Linear Approximation in General Dimensions

Published Online:December 29, 2025

https://doi.org/10.1287/ijoo.2025.0074

A Quantum Dual Logarithmic Barrier Method for Linear Optimization

Published Online:December 5, 2025

https://doi.org/10.1287/ijoo.2024.0062

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.