Discrete Optimizing

DOI10.1137/0113056MaRDI QIDQ5548074zbMATH OpenOpenAlexFDO

Authors Stanley Reiter, Gordon Sherman

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

Cited in

(15)

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

This page was built for publication: Discrete Optimizing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5548074)