ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Linear programming”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

math.OCcs.DSTheoreticalRecentOct 19, 2026

Solving Classes of Linear Programs with Strongly Polynomial Straight Line Complexity in Strongly Polynomial Time

Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver +1 more

This paper presents an initialization framework and rounding procedure for interior point methods in linear programming, ensuring strongly polynomial time complexity.

View →
math.OCcs.DSTheoreticalRecentJun 10, 2026

On finding exact solutions of linear programs in the oracle model

Daniel Dadush, László A. Végh, Giacomo Zambelli

The paper presents an algorithm for solving linear programming problems in the oracle model with improved time complexity.

View →
cs.ITmath.COTheoreticalRecentAug 6, 2026

Moment-based linear programming bounds for locally recoverable codes

Shujian Li, Hengjia Wei, Maosheng Xiong

This paper derives new linear programming bounds for q-ary (r,δ)-locally recoverable codes, improving upon previous bounds and applying to both linear and nonlinear codes.

View →
math.OCcs.ROEmpiricalRecentJun 23, 2026

Parallel Dynamic Programming for Conic Linear Quadratic Control

Luyao Zhang, Gabriel Bravo-Palacios, Brian Plancher, Sergio Grammatico

The paper presents a parallel-in-time approach to solve computationally demanding conic optimal control problems using the alternating direction method of multipliers.

View →
cs.PLmath.OCTheoreticalRecentJun 9, 2026

Max-Policy Iteration, Revisited

David Monniaux, Helmut Seidl

This paper improves max-policy iteration by replacing mathematical optimization with value iteration and proposes min-policy iteration as an alternative to linear programming.

View →
cs.DScs.DMTheoreticalRecentJul 23, 2026

Approximation Algorithms for Inventory Problems with Decomposable Submodular Ordering Costs

Retsef Levi, Georgia Perakis, Emily Zhang

This paper proposes an approximation algorithm for the submodular joint replenishment problem with decomposable submodular ordering cost functions, achieving an O(k)-approximation.

View →
cs.DSTheoreticalRecentOct 19, 2026

Integer Programing: An Algorithm with Exponent Linear in the Dimension

Lin Chen, Yuchen Mao, Guochuan Zhang

The authors provide a deterministic algorithm for solving integer programs in standard form with improved running time.

View →
cs.DScs.GTTheoreticalRecentJul 21, 2026

Packing Linear Programs and Fractional Knapsack using Comparison Oracles

Ritabrata Barat, Siddharth Barman, Nirjhar Das, Sukruta Midigeshi

This paper presents a polynomial-time algorithm for recovering item values in the fractional knapsack problem using comparison queries, and provides a lower bound.

View →
cs.NEcs.AIRecentMay 29, 2026

Linear Ordering Problem: Time for a Change

Fabrizio Fagiolo, Marco Baioletti, Valentino Santucci

The paper addresses limitations in the Linear Ordering Problem (LOP) by introducing a novel benchmark suite derived from current economic data and an algorithmic scheme to generate diverse, high-quali…

View →
math.OCcs.DMTheoreticalRecentJun 16, 2026

An Adaptive Algorithm for the Approximation of General Linear-Parametric Optimization Problems

Levin Nemesch, Stefan Ruzika, Clemens Thielen, Alina Wittmann

A new algorithm is proposed for approximating solutions to linear-multi-parametric optimization problems with negative parameter dependencies and non-fixed parameter sets.

View →
cs.DScs.LGTheoreticalRecentAug 3, 2026

The Condition-Number Barrier in Sparse Least Squares

Honghao Lin, Vahab Mirrokni, David P. Woodruff

The paper establishes a lower bound for the improvement of linear dependence on the restricted condition number in sparse convex optimization, using the Small-Set Expansion Hypothesis.

View →
cs.DMTheoreticalRecentJun 27, 2026

Local Minima in Quadratic-Penalty Relaxations of Binary Linear Programs

Cheng-Han Huang, Yongliang Sun, Chaoyan Huang, Ismail Alkhouri +1 more

The paper establishes conditions for QUBO formulations of combinatorial optimization problems that guarantee valid binary and feasible local minimizers using gradient-based methods.

View →
cs.DMTheoreticalRecentJul 3, 2026

Scheduling Tasks towards Energy Autarky: Benefits and Computational Costs of Flexibility

Robert Bredereck, Till Fluschnik, Klaus Heeger

This paper studies the autarky problem of scheduling energy-consuming jobs with time windows using a battery and an energy forecast, and shows NP-hardness, polynomial-time solvability, and fixed-param…

View →
math.COcs.CCTheoreticalRecentJul 9, 2026

Polynomial Binary Optimization

Endre Boros

The paper develops an explicit multi-linear polynomial form for binary polynomial optimization problems after eliminating a subset of variables, allowing for characterization of new special classes wi…

View →
cs.CCcs.GTcs.LGTheoreticalRecentJun 15, 2026

The Complexity of Min-Max Optimization for Quadratic Polynomials

Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Alexandros Hollender

Computing approximate stationary points of min-max optimization over the hypercube is proven to be PPAD-hard for quadratic polynomials.

View →
cs.DSTheoreticalRecentJun 26, 2026

Incremental Submodular Maximization: Better Than Greedy

Marcin Bienkowski, Joakim Blikstad, Jarosław Byrka, Martín Costa +2 more

The paper presents an adaptive scaling algorithm with a competitive ratio of 1.373 for incremental submodular maximization under increasing cardinality constraint, improving upon the previous best res…

View →