An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers

This article presents an exact algorithm for the precedence-constrained traveling salesman problem, which is also known as the sequential ordering problem. This NP-hard problem has applications in various domains, including operational research and compilers. In this article, the problem is presente...

Full description

Saved in:

Bibliographic Details
Published in:	Computational optimization and applications Vol. 61; no. 2; pp. 343 - 372
Main Authors:	Shobaki, Ghassan, Jamal, Jafar
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.06.2015 Springer Nature B.V
Subjects:	Algorithms Analysis Branch & bound algorithms Computer science Convex and Discrete Geometry Energy Energy consumption Heuristic Linear programming Management Science Mathematics Mathematics and Statistics Operations Research Operations Research/Decision Theory Optimization Production planning Schedules Scheduling Statistics Studies Traveling salesman problem Switching energy Sequential ordering problem Low energy computing Precedence-constrained traveling salesman problem Instruction scheduling Low power computing Branch-and-bound enumeration NP-complete problems Compiler optimizations
ISSN:	0926-6003, 1573-2894
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!