First vs. best improvement: an empirical study
From MaRDI portal
Publication:2489903
DOI10.1016/J.DAM.2005.05.020zbMATH Open1120.90048OpenAlexW2153654605MaRDI QIDQ2489903FDOQ2489903
Authors: Pierre Hansen, Nenad Mladenović 
Publication date: 28 April 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.05.020
Recommendations
- Strive to be first or avoid being last: an experiment on relative performance incentives
- First-mover advantage in best-of series: an experimental comparison of role-assignment rules
- Improvement theory and its applications
- scientific article; zbMATH DE number 1940297
- Meta-Analysis of the Impact of Research Methods on Findings of First-Mover Advantage
- Improving decision making by using performance feedback: An empirical study
- Mean changes versus dichotomous definitions of improvement
- Improved approximation to first-best gains-from-trade
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- On the shortest spanning subtree of a graph and the traveling salesman problem
- A method for solving traveling-salesman problems
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
- Variable Neighborhood Search
- Title not available (Why is that?)
- The traveling-salesman problem
- Fast Algorithms for Geometric Traveling Salesman Problems
- Data Structures for Traveling Salesmen
Cited In (28)
- Multistart search for the cyclic cutwidth minimization problem
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
- Memetic self-adaptive evolution strategies applied to the maximum diversity problem
- Less is more: general variable neighborhood search for the capacitated modular hub location problem
- Variable neighbourhood search: Methods and applications
- Variable neighborhood search: the power of change and simplicity
- Variable neighbourhood search: methods and applications
- Speed-up techniques for solving large-scale biobjective TSP
- Worst improvement based iterated local search
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- A VNS approach to multi-location inventory redistribution with vehicle routing
- Order matters -- a variable neighborhood search for the swap-body vehicle routing problem
- Variable neighborhood search: basics and variants
- A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
- A new fuzzy model for multi-criteria project portfolio selection based on modified Kerre's inequality
- Partial neighborhood local searches
- A local search heuristic for the \((r| p)\)-centroid problem in the plane
- A simple and effective evolutionary algorithm for the capacitated location-routing problem
- An iterated greedy algorithm for finding the minimum dominating set in graphs
- The uncapacitated r‐allocation p‐hub center problem
- Variable neighborhood search for the heaviest \(k\)-subgraph
- Finding the maximum multi improvement on neighborhood exploration
- Constructive-destructive heuristics for the safe set problem
- Efficient iterated greedy for the two-dimensional bandwidth minimization problem
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- In-depth analysis of granular local search for capacitated vehicle routing
- A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments
Uses Software
This page was built for publication: First vs. best improvement: an empirical study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489903)
