Pages that link to "Item:Q3975934"
From MaRDI portal
The following pages link to The analysis of local search problems and their heuristics (Q3975934):
Displaying 30 items.
- Equilibria, fixed points, and complexity classes (Q458480) (← links)
- A note on the complexity of local search problems (Q673814) (← links)
- Analyzing the complexity of finding good neighborhood functions for local search algorithms (Q857808) (← links)
- Complexity of local search for the \(p\)-median problem (Q932191) (← links)
- Structural analysis of local search heuristics in combinatorial optimization (Q1095797) (← links)
- How easy is local search? (Q1109573) (← links)
- Autocorrelation coefficient for the graph bipartitioning problem (Q1127331) (← links)
- Local search and the local structure of NP-complete problems (Q1200797) (← links)
- Mechanisms for local search (Q1266572) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- The problem of intractability and analysis of heuristics in discrete optimization. I (Q1320831) (← links)
- On the quality of local search for the quadratic assignment problem (Q1383366) (← links)
- A new extension of local search applied to the Dial-A-Ride problem (Q1388930) (← links)
- A local search template. (Q1406708) (← links)
- Tabu search for resource-constrained scheduling (Q1609891) (← links)
- Data-independent neighborhood functions and strict local optima (Q1763477) (← links)
- The complexity of Boolean constraint satisfaction local search problems (Q1777392) (← links)
- On the depth of combinatorial optimization problems (Q1801676) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Polynomial transformations and data-independent neighborhood functions (Q1887061) (← links)
- How difficult is the frequency selection problem? (Q1905076) (← links)
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue (Q1908990) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Parallel local search (Q1922627) (← links)
- On the \(\mathcal {PLS}\)-complexity of maximum constraint assignment (Q1935800) (← links)
- Dynamics of local search trajectory in traveling salesman problem (Q2491325) (← links)
- (Q4350078) (← links)
- Analysis of a Local Search Heuristic for Facility Location Problems (Q4512576) (← links)
- The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata (Q5418964) (← links)
- Expansion-based hill-climbing (Q6074953) (← links)
