Polyhedral structure of the 4-node network design problem

This article studies the polyhedral structure of the 4‐node network design problem (NDP). Using a theorem from the previous work of this author, the facets of the 4‐node NDP can be translated into facets of larger size problems. The knowledge of complete polyhedral description of the 4‐node NDP is i...

Full description

Saved in:
Bibliographic Details
Published in:Networks 2009-10, Vol.54 (3), p.139-149
Main Author: Agarwal, Yogesh K.
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Exact sciences and technology
facet inequality
Flows in networks. Combinatorial problems
integer programming
k-partition
multicommodity
network design
Operational research and scientific management
Operational research. Management science
polyhedral structure
Software
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This article studies the polyhedral structure of the 4‐node network design problem (NDP). Using a theorem from the previous work of this author, the facets of the 4‐node NDP can be translated into facets of larger size problems. The knowledge of complete polyhedral description of the 4‐node NDP is important because it implies complete knowledge of 4‐partition‐based facets of larger NDPs. After reviewing the previously known facets of the 4‐node NDP, a new class of facets is derived. An enumerative methodology is presented for determining whether a given set of inequalities provides a complete polyhedral description. By implementing this methodology in a computer code, it is determined that the known facets of the 4‐node NDP indeed provide a complete polyhedral description of the problem. Working of the proof methodology is illustrated with examples, and the results of the computer enumeration are reported. © 2009 Wiley Periodicals, Inc. NETWORKS, 2009
ISSN:0028-3045
1097-0037
DOI:10.1002/net.20317