The following pages link to How easy is local search? (Q1109573):
Displaying 50 items.
- Finding optimal subgraphs by local search (Q1392027) (← links)
- A local search template. (Q1406708) (← links)
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947) (← links)
- A Sperner lemma complete for PPA (Q1603412) (← links)
- Complexity of single-swap heuristics for metric facility location and related problems (Q1628593) (← links)
- An abstraction-refinement methodology for reasoning about network games (Q1630443) (← links)
- Colorful linear programming, Nash equilibrium, and pivots (Q1707915) (← links)
- Knowledge-guided local search for the vehicle routing problem (Q1722960) (← links)
- Efficiently solving very large-scale routing problems (Q1738815) (← links)
- Data-independent neighborhood functions and strict local optima (Q1763477) (← links)
- The complexity of Boolean constraint satisfaction local search problems (Q1777392) (← links)
- On complexity of unconstrained hyperbolic 0--1 programming problems (Q1779713) (← links)
- On the depth of combinatorial optimization problems (Q1801676) (← links)
- Paroid search: Generic local combinatorial optimization (Q1801678) (← links)
- Sequential and parallel local search for the time-constrained traveling salesman problem (Q1803676) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Ordinal notations and well-orderings in bounded arithmetic (Q1861331) (← links)
- On local search for the generalized graph coloring problem (Q1870000) (← links)
- What are the \(\forall \Sigma_ 1^ b\)-consequences of \(T_ 2^ 1\) and \(T_ 2^ 2\)? (Q1899145) (← links)
- Solving the max-cut problem using eigenvalues (Q1900149) (← links)
- How difficult is the frequency selection problem? (Q1905076) (← links)
- Matrix representation and gradient flows for NP-hard problems (Q1906756) (← links)
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue (Q1908990) (← links)
- A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs (Q1909003) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Parallel local search (Q1922627) (← links)
- On the \(\mathcal {PLS}\)-complexity of maximum constraint assignment (Q1935800) (← links)
- Dynamics in network interaction games (Q1938382) (← links)
- Black-box search by unbiased variation (Q1945171) (← links)
- Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\) (Q1961444) (← links)
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP (Q1962023) (← links)
- Computational aspects of the colorful Carathéodory theorem (Q1991350) (← links)
- On the complexity of finding a Caristi's fixed point (Q2032159) (← links)
- The complexity of the parity argument with potential (Q2037189) (← links)
- The complexity of finding fair independent sets in cycles (Q2087771) (← links)
- Characterising the intersection of QMA and coQMA (Q2099640) (← links)
- Combinatorial auctions with endowment effect (Q2100637) (← links)
- Timed network games (Q2112796) (← links)
- Unique end of potential line (Q2194856) (← links)
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art (Q2242290) (← links)
- Cache me if you can: capacitated selfish replication games in networks (Q2300628) (← links)
- How long does it take for all users in a social network to choose their communities? (Q2334040) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- Circuit principles and weak pigeonhole variants (Q2383589) (← links)
- Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) (Q2388433) (← links)
- Recursive stochastic games with positive rewards (Q2422034) (← links)
- Local search for string problems: brute-force is essentially optimal (Q2437744) (← links)
- Patience of matrix games (Q2444536) (← links)
- An analysis of neighborhood functions on generic solution spaces (Q2462147) (← links)
- Memetic algorithms: The polynomial local search complexity theory perspective (Q2481603) (← links)
