Order preserving reductions and polynomial improving paths
From MaRDI portal
Publication:2583701
DOI10.1016/J.ORL.2005.01.003zbMATH Open1080.90061OpenAlexW2052548200MaRDI QIDQ2583701FDOQ2583701
Authors: Derek E. Armstrong, Sheldon H. Jacobson 
Publication date: 18 January 2006
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2005.01.003
Recommendations
- Polynomial transformations and data-independent neighborhood functions
- Data-independent neighborhood functions and strict local optima
- Integer Programming: Optimization and Evaluation Are Equivalent
- Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme
- Approximation preserving reductions
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- How easy is local search?
- Approximate solution of NP optimization problems
- On approximation scheme preserving reducibility and its applications
- Hill Climbing with Multiple Local Optima
- Polynomial transformations and data-independent neighborhood functions
- The effectiveness of finite improvement algorithms for finding global optima
- Analyzing the complexity of finding good neighborhood functions for local search algorithms
- Data-independent neighborhood functions and strict local optima
Cited In (3)
This page was built for publication: Order preserving reductions and polynomial improving paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583701)
