scientific article; zbMATH DE number 1488895

MaRDI QIDQ4495733zbMATH OpenFDO

Authors

Publication date 18 April 2001

zbMATH Keywords

multicommodity flownetwork optimizationpainted multi-path algorithmpenalty functionsimulated annealing

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• A simulated annealing for multi-criteria network path problems
• APPLYING SIMULATED ANNEALING TO THE MULTIDIMENSIONAL ASSIGNMENT PROBLEM
• A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem
• Multi-Objective Simulating Annealing for Permutation Flow Shop Problems
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• A new simulated annealing algorithm for the Freight Consolidation Problem
• Simulated annealing for the 0/1 multidimensional knapsack problem
• A combined procedure for discrete simulation-optimization problems based on the simulated annealing framework
• scientific article; zbMATH DE number 1389083

Cited in

(1)

• Quadratic cost flow and the conjugate gradient method

This page was built for publication:

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