Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

The general routing polyhedron: a unifying framework

Article Abstract:

The General Routing Problem (GRP) has many practical applications and includes some well-known routing problems as special cases including that involving the Steiner Graphical Traveling Salesman Problem (SGTSP) and Graphical Traveling Salesman Problem (GTSP). It will be shown that a strong polyhedral association exists between the GTSP, SGTSP and GRP. In a sense, it may be said that the only area open to further research in this field is the specification of conditions under which facets of GTSP polyhedra yield facets of GRP polyhedra.

Author: Letchford, Adam N.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
Case studies, Evaluation, Scheduling (Management), Algorithms, Numerical calculations

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


The General Routing Problem polyhedron: facets from the RPP and GTSP polyhedra

Article Abstract:

A new type of explicit facet-inducing inequalities called honey-comb constraints was uncovered after an in-depth analysis of General Routing Problem (GRP) polyhedron was undertaken. The inequalities, which generalize the K-C constraints, are found to be helpful in the resolution of GRP, as well as the Rural Postman Problem (RPP). Solution of GRP was also found to be highly probable provided that determination of violated honeycomb inequalities is achieved.

Author: Corberan, A., Sanchis, J.M.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
Research and Development in the Physical, Engineering, and Life Sciences, Mathematics, Research, Honeycomb structures, Honeycomb structures (Materials)

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program

Article Abstract:

Various efficient solutions have been developed to solve multiple objective linear programming (MOLP) problems. However, these solutions have generally not considered the development of a technique for helping a decision maker choose a final operational solution from a set of efficient solutions. It is shown that a model based on the theory of polyhedral polarity exhibited functional applications for MOLP problems.

Author: Gallagher, Richard J., Saleh, Ossama A.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Models, Analysis, Linear programming, Polyhedra, Polyhedrons, Functions, Polyhedral, Polyhedral functions
Similar abstracts:
  • Abstracts: EMI considers acquiring Seagram's PolyGram unit. EMI, Launch have deal for music on the Internet. Applied Power to acquire Rubicon for $347.8 million
  • Abstracts: Organising for market segmentation in banking: the impact from production technology and coherent bank norms. A frontier analysis comparision of banking 'added value'
  • Abstracts: One society, stretched and divided. The Berlin republic. The burden of normality
  • Abstracts: The Italian market for clothing & footwear. The Italian market for perfumes & fragrances. European markets: Clothing & footwear
  • Abstracts: A semi-integrated world. Behold, the emerald city. Freedom from want?
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.