JSTOR Daily

Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem

The Time-Dependent Traveling Salesman Problem (TDTSP) is a generalization of the Traveling Salesman Problem (TSP) in which the cost of travel between two cities depends on the distance between the ...
JSTOR Daily

Integrating heuristic information into exact methods: The case of the vertex p-centre problem

We solve the vertex p-centre problem optimally using an exact method that considers both upper and lower bounds as part of its search engine. Tight upper bounds are generated quickly via an efficient ...
The Conversation

How to teach Deep Blue to play poker and deliver groceries

Graham Kendall has received funding from the UK's Engineering and Physical Sciences Research Council (EPSRC) to conduct research into hyper-heuristics. Deep Blue gained world-wide attention in 1997 ...
Foreign Affairs

Nuclear Heuristics: Selected Writings of Albert and Roberta Wohlstetter; Thinking About Nuclear Weapons: Principles, Problems, Prospects

In the world of U.S. strategic studies, the Wohlstetters have achieved almost legendary status, with due regard paid to Albert's achievement in recasting the entire nuclear debate by stressing the ...
BMJ

Towards research-based approaches for solving body composition problems in sports: ski jumping as a heuristic example

Correspondence to Dr W Müller, Human Performance Research Graz, Max-Mell-Allee 11, 8010 Graz, Austria; wolfram.mueller{at}uni-graz.at If you wish to reuse any or all ...