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

20 results for “Combinatorial optimization”

CS papers only

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

Want pure semantic search? Try claim verification →

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.DSEmpiricalRecentAug 5, 2026

Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics

Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen +1 more

This paper demonstrates that treewidth dynamic programming (TDP) can be used to enhance the performance of various graph combinatorial optimization algorithms.

View →
cs.LGRecentJun 1, 2026

Regularized Large Neighborhood Search

Germain Vivier-Ardisson, Laurent Demonet, Axel Parmentier, Mathieu Blondel

The paper introduces Regularized Large Neighborhood Search (RLNS), a method that adapts the LNS heuristic into an efficient MCMC sampler for combinatorial optimization, allowing end-to-end learning wi…

View →
cs.NETheoreticalRecentJun 16, 2026

Evolutionary Algorithms and Multi-Objective Minimum Spanning Trees with Limited Distinct Weight Values

Narges Tavassoli Kejani, Andrew M. Sutton, Frank Neumann

This paper provides new runtime results and experimental investigations for evolutionary multi-objective algorithms on the multi-objective minimum spanning tree problem.

View →
cs.LGEmpiricalRecentJul 1, 2026

Neural Certificate Pricing for Combinatorial Optimization Problems

Jingyi Chen, Xinyuan Zhang, Xinwu Qian

This paper introduces Neural Certificate Pricing (NCP), an unsupervised learning framework that exploits the asymmetry between certifiable discrete structures and structural feasibility in combinatori…

View →
cs.AImath.OCRecentMay 30, 2026

LLM-Driven Co-Evolutionary Automated Heuristic Design for Bi-Component Coupled Combinatorial Optimization

Mingen Kuang, Xudong Deng, Xi Lin, Ye Fan +2 more

The paper proposes CoEvo-AHD, an LLM-driven co-evolutionary framework that co-evolves two coupled operator populations to design effective heuristics for combinatorial optimization problems with stron…

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 →
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.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 →
cs.CCcs.DSTheoreticalRecentAug 5, 2026

On the Approximability of Boolean Max-$k$-CSP

Ainesh Bakshi

This paper presents a polynomial time algorithm for maximizing the number of satisfied constraints in a boolean constraint satisfaction problem, achieving a $(k/2^k)$-approximation.

View →
cs.DSTheoreticalRecentJun 16, 2026

Reducing Prize-Collecting Stroll and Related Routing Problems to Prize-Collecting TSP

Hong Li

This paper improves the approximation algorithm for the prize-collecting stroll problem.

View →
cs.CCTheoreticalRecentJun 14, 2026

Quiet Planting for $k$-SAT, Multiple Solutions of Arbitrary Geometry

Ali Ahmadi, Kiarash Banihashem, Iman Gholami, Mohammad Taghi Hajiaghayi +1 more

This paper proposes a method to construct quiet planting distributions for k-SAT formulas with an arbitrary number of solutions.

View →
cs.DScs.DMmath.COTheoreticalRecentAug 4, 2026

Bicriteria Approximation Algorithms for Demand Matching

Yuchong Pan, Michel X. Goemans

This paper presents approximation algorithms and lower bounds for the demand matching problem, which generalizes the knapsack and b-matching problems.

View →
cs.NEEmpiricalRecentJun 8, 2026

Local Search on Vertex Coloring for Bipartite Graphs

Johanna Gasse

This paper explores the capabilities and limitations of local search on the vertex coloring problem and introduces a new mutation operator that improves run time.

View →