Discrete Optimizing

DOI10.1137/0113056zbMath0163.41201OpenAlexW4252166328MaRDI QIDQ5548074

Gordon Sherman, Stanley Reiter

Publication date: 1965

Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0113056

zbMATH Keywords

operations research

Related Items

A theoretical minimal solution for heuristics: the case of the spatial harvest timber problem, The vehicle routing problem with flexible time windows and traveling times, Heuristics and their design: A survey, An effective structured approach to finding optimal partitions of networks, Recent progress of local search in handling the time window constraints of the vehicle routing problem, Discrete optimization by optimal control methods. II: The static traveling salesman problem, An iterated local search algorithm for the time-dependent vehicle routing problem with time windows, Recent progress of local search in handling the time window constraints of the vehicle routing problem, Some theoretical implications of local optimization, Heuristische Verfahren zur Lösung allgemeiner ganzzahliger linearer Optimierungsprobleme (Ein überblick), Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient, A stopping rule for optimization using randomized search procedures, Maximum internally stable sets of a graph, Combinatorial optimization by stochastic automata, The optimum assignments and a new heuristic approach for the traveling salesman problem