Exact solution methods for uncapacitated location problems with convex transportation costs

Article Abstract:

A study was conducted to analyze exact solution techniques for uncapacitated facility location problems wherein the transportation costs are nonlinear and convex. An exact linearization of the costs was developed to characterize the problem as an extended, linear pure zero-one location framework. The solution methods considered in the study include the direct solution with a standard branch-and-bound code, the dual ascent and adjustment technique and the dual ascent and branch-and-bound.

Management Dynamics NEC, Management, Usage, Algorithms, Transportation, Management techniques

---

Equitable aggregations and multiple criteria analysis

Article Abstract:

New approaches have evolved in the area of operations research because of an increasing interest in equity issues. The subject of equitable dominance and equitably efficient solutions to multiple criteria optimization problems is examined. Equitable aggregations methods are solution concepts for multiple criteria problems.

Europe, Multiple criteria decision making

---

Bicriteria network location (BNL) problems with criteria dependant lengths and minisum objectives

Article Abstract:

A new location model is presented, which is a generalization of the bicriteria median problem. Two sum objectives and criteria dependant edge lengths are introduced.

Similar abstracts:

• Abstracts: One-dimensional machine location problems in a multi-product flowline with equidistant locations. The effect of material flow and workload on the performance of machine location heuristics
• Abstracts: Evaluating the integration of supply chain information systems: a case study. Approximation algorithms for k-unit cyclic solutions in robotic cells
• Abstracts: The bilevel linear/linear fractional programming problem. A goal programming approach to vehicle routing problems with soft time windows
• Abstracts: Makespan minimization on uniform parallel machines with release times. Concurrent flowshop scheduling to minimize makespan
• Abstracts: Concurrent flowshop scheduling to minimize makespan. A note on makespan minimization in two-stage flexible flow shops with uniform machines

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.