20 results for “Combinatorial optimization”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
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.
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.
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…
This paper provides new runtime results and experimental investigations for evolutionary multi-objective algorithms on the multi-objective minimum spanning tree problem.
This paper introduces Neural Certificate Pricing (NCP), an unsupervised learning framework that exploits the asymmetry between certifiable discrete structures and structural feasibility in combinatori…
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…
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…
A new algorithm is proposed for approximating solutions to linear-multi-parametric optimization problems with negative parameter dependencies and non-fixed parameter sets.
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…
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.
This paper improves the approximation algorithm for the prize-collecting stroll problem.
This paper proposes a method to construct quiet planting distributions for k-SAT formulas with an arbitrary number of solutions.
This paper presents approximation algorithms and lower bounds for the demand matching problem, which generalizes the knapsack and b-matching problems.
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.