No article text was recorded for this version.
local search scalability
Version 2 of 251 papers55 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Improving TSP Tours Using Dynamic Programming over Tree Decompositions
- Blog: Improved approximation for 3-dimensional matching via bounded pathwidth local search
- Blog: Don't Be Strict in Local Search!
- Blog: Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhood
- Blog: Local Covariate Selection for Average Causal Effect Estimation without Pretreatment and Causal Sufficiency Assumptions
- Blog: FLS: A New Local Search Algorithm for K-means with Smaller Search Space
- Blog: Parameterized Local Search for Max c-Cut
- Blog: Adaptive Neighborhood Inverse Consistency as Lookahead for Non-Binary CSPs
- Blog: Towards Optimizing Large-Scale Multi-Graph Matching in Bioimaging
- Blog: Efficient Heuristic Search for M-Modes Inference
- Blog: PILS: Exploring high-order neighborhoods by pattern mining and injection
- Blog: Two New Local Search Strategies for Minimum Vertex Cover
- Blog: Multi-Swap k-Means++
- Blog: Computational complexity and simulation of rare events of Ising spin glasses
- Blog: An Efficient Hybrid Genetic Algorithm for the Quadratic Traveling Salesman Problem
- Blog: Practical 0.385-Approximation for Submodular Maximization Subject to a Cardinality Constraint
- Blog: Local Search: Is Brute-Force Avoidable?
- Blog: Weighting-based Variable Neighborhood Search for Optimal Camera Placement
- Blog: Submodular Maximization Through Barrier Functions
- Blog: Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem
- Blog: Enhancing Network by Reinforcement Learning and Neural Confined Local Search
- Blog: A Swap Relaxation-Based Local Search for the Latin Square Completion Problem
- Blog: Can Local Optimality Be Used for Efficient Data Reduction?
- Blog: Learning to CROSS exchange to solve min-max vehicle routing problems
- Blog: LSDS++ : Dual Sampling for Accelerated k-means++
- Blog: Two-stage Tabu Search for Solving Parallel Machine Problems
- Blog: Improving TSP Tours Using Dynamic Programming over Tree Decompositions
- Blog: Maximizing the Influence Spread in Social Networks: A Learning-Automata-Driven Discrete Butterfly Optimization Algorithm
- Blog: A Simulated Annealing Approach to the Travelling Tournament Problem
- Blog: Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
- Blog: Approximation Guarantees of Local Search Algorithms via Localizability of Set Functions
- Blog: Efficient identification of improving moves in a ball for pseudo-boolean problems
- Blog: Linear Time Algorithms for k-means with Multi-Swap Local Search
- Blog: Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments
- Blog: Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution
- Blog: K-Medoids For K-Means Seeding
- Blog: Large Neighborhood Local Search for the Maximum Set Packing Problem
- Blog: Tabu-Driven Quantum Neighborhood Samplers
- Blog: Farsighted Probabilistic Sampling: A General Strategy for Boosting Local Search MaxSAT Solvers
- Blog: Three-Stage Tabu Search for Solving Large-Scale Flow Shop Scheduling Problems.
- Blog: Learning Locally Interpretable Rule Ensemble
- Blog: NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
- Blog: Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems
- Blog: Two-Sided Weak Submodularity for Matroid Constrained Optimization and Regression
- Blog: Exploiting Variable Associations to Configure Efficient Local Search in Large-Scale Set Partitioning Problems
- Blog: Deterministic Algorithms for Solving Boolean Polynomial Equations Based on Channel Coding Theory
- Blog: A Local Search-Based Approach for Set Covering
- Blog: Exploiting a Common Property Resource under a
- Blog: A Lower Bound for Local Search Proportional Approval Voting
- Blog: A Niching Memetic Algorithm for Multi-Solution Traveling Salesman Problem
- Blog: Discovering Interesting Cycles in Directed Graphs
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_local_search_scalability_0b8ce3e9,
title = {local search scalability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/local-search-scalability/rdr_0b8ce3e9af024148904b82feef5218e6},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 2, frozen text):
@misc{lacuna_local_search_scalability_0b8ce3e9_v2,
title = {local search scalability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/local-search-scalability/rdr_0b8ce3e9af024148904b82feef5218e6/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}