NAG Toolbox

H – operations research

• H Introduction
• h02bb – Integer LP problem (dense)
• nag_mip_ilp_dense
• h02bv – Print IP or LP solutions with user-specified names for rows and columns
• nag_mip_ilp_print
• h02bz – Integer programming solution, supplies further information on solution obtained by h02bb
• nag_mip_ilp_info
• h02cb – Integer QP problem (dense)
• nag_mip_iqp_dense
• h02cd – Supply optional parameter values to h02cb
• nag_mip_iqp_dense_optstr
• h02ce – Integer LP or QP problem (sparse), using e04nk
• nag_mip_iqp_sparse
• h02cg – Supply optional parameter values to h02ce
• nag_mip_iqp_sparse_optstr
• h02da – Mixed integer nonlinear programming
• nag_mip_sqp
• h02zk – Option setting routine for h02da
• nag_mip_optset
• h02zl – Option getting routine for h02da
• nag_mip_optget
• h03ab – Transportation problem, modified "stepping stone" method
• nag_mip_transportation
• h03ad – Shortest path problem, Dijkstra's algorithm
• nag_mip_shortestpath
• h03bb – Travelling Salesman Problem, simulated annealing
• nag_mip_tsp_simann
• h05aa – Best n subsets of size p (reverse communication)
• nag_best_subset_given_size_revcomm
• h05ab – Best n subsets of size p (direct communication)
• nag_best_subset_given_size

G13

M01