Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Solving linear programming relaxations associated with lagrangean relaxations by Fenchel cutting planes

Article Abstract:

Issues relating to the usage of Lagragean relaxations are examined in detail, with a comparison between Lagangean and Fenchel cutting planes.

Author: Saez, Jesus
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
Research and Development in the Physical, Engineering, and Life Sciences, Mathematics, Lagrangian functions

User Contributions:

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

CAPTCHA


Graph theoretic relaxations of set covering and set partitioning problems

Article Abstract:

Alternative graph theoretic relaxations to the scheduling and planning problems known as set covering problem and set partitioning problem are investigated. They are based on an assignment, a shortest route and a minimal spanning tree. Other relaxations in the literature are also reviewed. They include the network flow, the maximum matching and the graph covering relaxations.

Author: Mitra, Gautam, El-Darzi, Elia
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995
Operations research, Management science, Case studies, Graph theory, Relaxation methods (Mathematics)

User Contributions:

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

CAPTCHA


Tight linear programming relaxations of uncapacitated p-hub median problems

Article Abstract:

New mixed zero-one linear models with tight linear programming relaxations for solving uncapacitated multiple and single allocation p-hub median problems that arise in the design of airports, courier networks and communication networks are introduced. The approach, which was implemented on real problems, results in mostly integral solutions and in LP relaxations of between 10,010-391,250 variables and 2,101-31,901 constraints.

Author: Skorin-Kapov, Darko, Skorin-Kapov, Jadranka, O'Kelly, Morton
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Linear programming

User Contributions:

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

CAPTCHA


Subjects list: Research, Integer programming
Similar abstracts:
  • Abstracts: Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. Scheduling with target start times
  • Abstracts: Bioengineered food fight in EU is coming soon: consumers have a choice with global consequences: Monsanto vs. Greenpeace
  • Abstracts: Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort
  • Abstracts: Airline efficiency differences between Europe and the US: implications for the pace of EC integration and domestic regulation
  • Abstracts: The plant location problem with demand-dependent setup costs and centralized allocation. A note on the location of an obnoxious facility on a network
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.