Optimal symbiosis of reservation and removal in the online knapsack problem
We study the online proportional knapsack problem with two paid forms of recourse. Items arrive one by one and must be handled immediately, without knowledge of the future: an algorithm may pack an…
Read the full articleYou might also wanna read
Decomposition and Successive Decomposition Methods and Algorithms for Nonconvex Optimization
Existing results on decomposition methods and algorithms for nonconvex problems are minimal. Parallel decomposition algorithms do not exist
The Mathematics of Data Structures: Why No Single Storage Solution Is Optimal
The math of data structures helps us understand how different storage systems come with different trade-offs between resources such as time
quantamagazine.org·6mo ago
Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles
arXiv:2607.09167v1 Announce Type: new Abstract: Schedule-Free methods have attracted growing interest for alleviating the burden of designin
Markets are competitive if and only if P != NP
I prove that competitive market outcomes require computational intractability. If P = NP, firms can efficiently solve the collusion detectio
arxiv.org·13d ago
Adaptive LLM Routing Using Contextual Bandits and Shared Embedding Space
Large Language Models (LLMs) have revolutionized natural language processing, but their varying capabilities and costs pose challenges in pr
arxiv.org·10mo ago
Exploring Computational Complexity: A Ruliological Approach to the P vs. NP Problem
A new look at what can be discovered about questions of computational complexity theory that have arisen in theoretical computer science--in
writings.stephenwolfram.com·5mo ago
Comments
Sign in to join the conversation.
No comments yet. Be the first.