Vicinal Sequencing Problems

Gerhard Jaeschke
Additional contact information
Gerhard Jaeschke: IBM Heidelberg Scientific Center, Heidelberg, Germany

Operations Research, 1972, vol. 20, issue 5, 984-992

Abstract: This paper describes a special class of sequencing problems called vicinal problems. They are solved by a combination of the methods of graph theory and combinatorial programming. We analyze decomposition possibilities of complete, antisymmetric graphs in order to achieve the partition of the problems into several subproblems that can be solved by combinatorial programming procedures such as back-tracking and branch-and-bound. We conclude by treating a numerical example and commenting on a program written for that purpose.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.20.5.984 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:20:y:1972:i:5:p:984-992

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().