Technical Note—Minimizing a Function of Permutations of n Integers

DOI10.1287/OPRE.19.1.237MaRDI QIDQ5616593zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 4127014
• scientific article; zbMATH DE number 3865283
• Optimal search for locally feasible solutions of a linear function on permutations
• scientific article; zbMATH DE number 26585
• On the matrix permutation problem

Cited in

(10)

• Star search -- a different show
• Sequential testing of complex systems: a review
• Optimal search for locally feasible solutions of a linear function on permutations
• 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
• The Organ Pipe Permutation
• 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
• Theory and methodology of time-dependent scheduling: past, present and future
• Scheduling time-dependent jobs under mixed deterioration

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

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