A complete anytime algorithm for number partitioning

1998/12/01 by Richard E. Korf · 10 citations
Computer Science · Decision Sciences · #Complexity and Algorithms in Graphs #Scheduling and Timetabling Solutions #Constraint Satisfaction and Optimization

paper · doi:10.1016/s0004-3702(98)00086-1

Cited by

• Towards Better Response Times and Higher-Quality Queries in Interactive Knowledge Base Debugging
• A Family of Convex Models to Achieve Fairness through Dispersion Control
• Accelerating Mobile Language Model via Speculative Decoding and NPU-Coordinated Execution
• A Novel Approach to Quantum Heuristics for Structured Database Search
• A Quadratic Time Locally Optimal Algorithm for NP-hard Equal Cardinality Partition Optimization
• Neuron splitting in compute-bound parallel network simulations enables runtime scaling with twice as many processors. [europepmc]
• A graph-based approach for proteoform identification and quantification using top-down homogeneous multiplexed tandem mass spectra. [europepmc]
• Asynchronous Branch-Parallel Simulation of Detailed Neuron Models. [europepmc]
• A programmable hybrid digital chemical information processor based on the Belousov-Zhabotinsky reaction. [europepmc]
• Computing with oscillators from theoretical underpinnings to applications and demonstrators. [europepmc]