Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Network distance characteristics that affect computational effort in p-median location problems

Article Abstract:

Research is presented concerning the development of a series of networks for a p-median model which compares the quality of solutions obtained with the effort expended. The factors influencing the solving effort are discussed.

Author: Schilling, D.A., Rosing, K.E., ReVelle, C.S.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
Problem solving, Heuristic programming

User Contributions:

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

CAPTCHA


Heuristic concentration: two stage solution construction

Article Abstract:

The Heuristic Concentration methodology for enhancing the effectiveness of heuristic solutions to combinatorial optimization problems is introduced. The two-stage strategy, which is illustrated using the p-median problem, constructs a concentrated solution set (CS) during the first stage by exploiting information from multiple iterations of an interchange heuristic. It then derives the optimal solution from the restricted CS during the second stage using an exact procedure.

Author: Rosing, K.E., ReVelle, C.S.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
Case studies, Industrial locations, Industrial location

User Contributions:

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

CAPTCHA


A gamma heuristic for the p-median problem

Article Abstract:

Heuristic concentration (HC) is a two-stage metaheuristic that can be used for a broad range of combinatorial problems. The HC as applied to the p-median problem was investigated in which a heuristic second stage offers similar solution quality compared to that given by an exact method in the second stage with a smaller m. If the size of m for the exact method were increased to the level of that employed for the heuristic second stage, the computation times for the optimal solution of integer linear programming (ILP)-1 or ILP-2 would increase substantially.

Author: Schilling, D.A., Rosing, K.E., ReVelle, C.S.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
Methods, Analysis, Linear programming, Usage, Heuristic, Heuristics (Psychology)

User Contributions:

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

CAPTCHA


Subjects list: Research, Combinatorial optimization, Operations research, Management science, Integer programming
Similar abstracts:
  • Abstracts: Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem. An exact method for the two-echelon, single-source, capacitated facility location problem
  • Abstracts: Marsh faces hurdles to regain investor trust as it confronts additional set of allegations. Xerox's net falls but CEO declares turnaround done
  • Abstracts: Italy's Sanpaolo intends to acquire Foundation's stake in Cardine Banca. Dexia suspends Sanpaolo talks as holders balk
  • Abstracts: How to mix skating, shopping and cyberspace; Parisian store Printemps takes electronic commerce to the illogical extreme. (Pinault Printemps Redoute S.A.)
  • Abstracts: Unilever to cut jobs and close factories; consumer goods firm to focus on core brands. Unilever renames Jif to Cif in U.K. to simplify brand
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.