Partial polyhedral description and generation of discrete optimization problems with known optima

Martha G. Pilcher and Ronald L. Rardin

Naval Research Logistics (NRL), 1992, vol. 39, issue 6, 839-858

Abstract: We detail a random cut concept for generating instances of discrete optimization problems based on a partial description of the polytope of solutions. We show how implementations of this approach have the useful properties that an optimal solution and the form of valid equalities required to solve the problem by cutting methods are both known at the completion of generation. The former makes possible large‐scale testing of heuristics, and the latter facilitates cutting algorithm research. The random cut concept of problem generation is first discussed in general and then details are provided on its implementation for symmetric traveling salesman problems.

Date: 1992
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199210)39:63.0.CO;2-C

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:wly:navres:v:39:y:1992:i:6:p:839-858

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().