No article text was recorded for this version.
local optima entrapment
Version 1 of 1204 papers216 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Multi-Objectivizing Sum-of-the-Parts Combinatorial Optimization Problems by Random Objective Decomposition
- Blog: Computing Minimum Cuts by Randomized Search Heuristics
- Blog: Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method
- Blog: An Extension of Plücker Relations with Applications to Subdeterminant Maximization
- Blog: Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem
- Blog: Adaptive Bias Generalized Rollout Policy Adaptation on the Flexible Job-Shop Scheduling Problem
- Blog: Choosing the Right Algorithm With Hints From Complexity Theory
- Blog: Improved Approximation Guarantees for Lower-Bounded Facility Location
- Blog: Learning to Perform Local Rewriting for Combinatorial Optimization
- Blog: EWLS: A New Local Search for Minimum Vertex Cover
- Blog: Restart and Random Walk in Local Search for Maximum Vertex Weight Cliques with Evaluations in Clustering Aggregation
- Blog: Scalability of Genetic Programming and Probabilistic Incremental Program Evolution
- Blog: Introduction to the CPAIOR 2020 fast track issue
- Blog: Transport Logistics Planning with Service-Level Constraints
- Blog: CONFIG: Constrained Efficient Global Optimization for Closed-Loop Control System Optimization with Unmodeled Constraints
- Blog: Farsighted Probabilistic Sampling based Local Search for (Weighted) Partial MaxSAT
- Blog: Multi-issue Negotiation Protocol for Agents: Exploring Nonlinear Utility Spaces
- Blog: A probabilistic evolutionary optimization approach to compute quasiparticle braids
- Blog: Metaheuristic Approaches to Lexical Substitution and Simplification
- Blog: Derivative-free methods for mixed-integer nonsmooth constrained optimization
- Blog: Learning a Classification Model for Segmentation
- Blog: A New Parallel Cooperative Landscape Smoothing Algorithm and Its Applications on TSP and UBQP
- Blog: Vehicle Routing Optimization for Logistics Distribution based on Artificial Fish-swarm Algorithms
- Blog: Adaptive Simulated Annealing with Greedy Search for the Circle Bin Packing Problem
- Blog: Choosing Well Your Opponents: How to Guide the Synthesis of Programmatic Strategies
- Blog: Location Optimization of Wireless Sensor Network in Intelligent Workshop Based on the Three-Dimensional Adaptive Fruit Fly Optimization Algorithm
- Blog: Parameterized Local Search for Max c-Cut
- Blog: Focused Jump-and-Repair Constraint Handling for Fixed-Parameter Tractable Graph Problems
- Blog: Adding New Clauses for Faster Local Search
- Blog: Knowledge-Guided Optimization for Complex Vehicle Routing with 3D Loading Constraints
- Blog: Local Optima Correlation Assisted Adaptive Operator Selection
- Blog: Old Resolution Meets Modern SLS
- Blog: Efficient Multi-Start Strategies for Local Search Algorithms.
- Blog: Navigating the Energy Landscape of Collaboration: Multi-Agent Communication Graph Generation via Score-Based Diffusion
- Blog: Memetic algorithms for Spatial Partitioning problems
- Blog: Robust Optimization in Protein Fitness Landscapes Using Reinforcement Learning in Latent Space
- Blog: Fast Active Tabu Search and its Application to Image Retrieval
- Blog: Analysis of baseline evolutionary algorithms for the packing while travelling problem
- Blog: InfVC: An Inference-Enhanced Local Search Algorithm for the Minimum Vertex Cover Problem in Massive Graphs
- Blog: Generalized Fast Approximate Energy Minimization via Graph Cuts: Alpha-Expansion Beta-Shrink Moves
- Blog: Digging Deeper: Operator Analysis for Optimizing Nonlinearity of Boolean Functions
- Blog: An Exact Algorithm for the Unanimous Vote Problem
- Blog: Alternating Local Enumeration (TnALE): Solving Tensor Network Structure Search with Fewer Evaluations
- Blog: A Multiagent Path Search Algorithm for Large-Scale Coalition Structure Generation
- Blog: E-Syn: E-Graph Rewriting with Technology-Aware Cost Functions for Logic Synthesis
- Blog: Bottom-up learning of Markov logic network structure
- Blog: A Local-Search Algorithm for Steiner Forest
- Blog: On Computational Complexity of Pickup-and-Delivery Problems with Precedence Constraints or Time Windows
- Blog: CSM-416 A survey of AI-based meta-heuristics for dealing with local optima in local search
- Blog: Destroy and Repair Using Hyper Graphs for Routing
- Blog: SEEK2: A Generalized Approach to Automatic Knowledge Base Refinement
- Blog: A Spectral Clustering Algorithm Improved by P Systems
- Blog: Solving Constraint Optimization Problems in Anytime Contexts
- Blog: Heuristic for solving cyclic bandwidth sum problem by following the structure of the graph
- Blog: Fitness Uniform Selection to Preserve Genetic Diversity
- Blog: Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings
- Blog: Hybrid Quantum Tabu Search for Solving the Vehicle Routing Problem
- Blog: A Global Maximum Likelihood Super-Quartet Phylogeny Method
- Blog: Local Entropy Search over Descent Sequences for Bayesian Optimization
- Blog: A Reinforcement Learning Approach to job-shop Scheduling
Showing 60 of 204 papers.
History & citation
Current · Permanent link
- This direction split from Escaping Local Optima through Strategic Exploration (56% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_local_optima_entrapment_486a6903,
title = {local optima entrapment},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/local-optima-entrapment/rdr_486a690386424055aaf35a7bf90a8740},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_local_optima_entrapment_486a6903_v1,
title = {local optima entrapment},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/local-optima-entrapment/rdr_486a690386424055aaf35a7bf90a8740/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}