A distributed exact algorithm for the multiple resource constrained sequencing problem

DOI10.1007/BF02023171zbMath0779.90044MaRDI QIDQ2368093

Gautham K. Kudva, Joseph F. Pekny

Publication date: 23 August 1993

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

zbMATH Keywords

traveling salesmansequencingcutting planeprocess schedulingexact parallel branch and bound algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient algorithm for the minimum capacity cut problem
• A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
• Resource constrained assignment problems
• Solving Large-Scale Zero-One Linear Programming Problems
• The prize collecting traveling salesman problem
• Multi-Terminal Network Flows
• Facets of the knapsack polytope
• A parallel shortest augmenting path algorithm for the assignment problem

This page was built for publication: A distributed exact algorithm for the multiple resource constrained sequencing problem