Technical Note—Minimizing a Function of Permutations of n Integers

DOI10.1287/OPRE.19.1.237zbMath0214.18701OpenAlexW2138662293MaRDI QIDQ5616593

John G. Rau

Publication date: 1971

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.19.1.237

Mathematics Subject Classification ID

Integer programming (90C10) Permutations, words, matrices (05A05)

Related Items (7)

Sequential testing of complex systems: a review ⋮ Bounds on the minimum of convex functions on Euclidean combinatorial sets ⋮ A note on the optimality of index priority rules for search and sequencing problems ⋮ Scheduling time-dependent jobs under mixed deterioration ⋮ Star search -- a different show ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Pareto and scalar bicriterion optimization in scheduling deteriorating jobs

This page was built for publication: Technical Note—Minimizing a Function of Permutations of n Integers