The following pages link to Discrete Optimizing (Q5548074):
Displayed 15 items.
- Combinatorial optimization by stochastic automata (Q750309) (← links)
- The vehicle routing problem with flexible time windows and traveling times (Q860386) (← links)
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows (Q951117) (← links)
- The optimum assignments and a new heuristic approach for the traveling salesman problem (Q1051562) (← links)
- Heuristics and their design: A survey (Q1152854) (← links)
- An effective structured approach to finding optimal partitions of networks (Q1164549) (← links)
- Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient (Q1226033) (← links)
- A stopping rule for optimization using randomized search procedures (Q1232968) (← links)
- A theoretical minimal solution for heuristics: the case of the spatial harvest timber problem (Q2147056) (← links)
- Discrete optimization by optimal control methods. II: The static traveling salesman problem (Q2457582) (← links)
- Maximum internally stable sets of a graph (Q2530476) (← links)
- Some theoretical implications of local optimization (Q4120335) (← links)
- Heuristische Verfahren zur Lösung allgemeiner ganzzahliger linearer Optimierungsprobleme (Ein überblick) (Q4121710) (← links)
- Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5893964) (← links)
- Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5919996) (← links)