On the Complexity of Local Search in Unconstrained Quadratic Binary Optimization (Q2810549): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57434178, #quickstatements; #temporary_batch_1714629631253 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: New Results on the Old <i>k</i>-opt Algorithm for the Traveling Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimality Conditions for the Minimization of Quadratic 0-1 Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: How easy is local search? / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Equilibria, fixed points, and complexity classes / rank | |||
Normal rank | |||
Revision as of 02:04, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Local Search in Unconstrained Quadratic Binary Optimization |
scientific article |
Statements
On the Complexity of Local Search in Unconstrained Quadratic Binary Optimization (English)
0 references
3 June 2016
0 references
local optimization
0 references
binary quadratic optimization
0 references
exponential complexity
0 references
