Search Results - subject:"Lagrangian"

Database Allocation in a Distributed Environment: Incorporating a Concurrency Control Mechanism and Queuing Costs

Ram, Sudha; Narasimhan, Sridhar - In: Management Science 40 (1994) 8, pp. 969-983

procedure based on Lagrangian relaxation is proposed to solve the model. Computational results are reported along with several …

Persistent link: https://www.econbiz.de/10009203878

Economic Development of Groundwater in Arid Zones with Applications to the Negev Desert, Israel

Brimberg, Jack; Mehrez, Abraham; Oron, Gideon - In: Management Science 40 (1994) 3, pp. 353-363

and local levels, and water quality requirements at the local sites. A Lagrangian relaxation reduces the model to a series …

Persistent link: https://www.econbiz.de/10009197515

Locating Tax Facilities: A Graphics-Based Microcomputer Optimization Model

Domich, Paul D.; Hoffman, Karla L.; Jackson, Richard H. F. - In: Management Science 37 (1991) 8, pp. 960-979

obtain "good" solutions to the problem and is coupled with a lagrangian-relaxation technique providing a measure of how far …

Persistent link: https://www.econbiz.de/10009209169

Designing Telecommunications Networks for the Reseller Market

Bard, Jonathan F.; Bejjani, Wassim A. - In: Management Science 37 (1991) 9, pp. 1125-1146

This paper presents an algorithm for minimizing the monthly cost of telecommunications networks characterized by multichannel queues with forced balking and hierarchical routing plans. The problem is of major interest to resellers of long distance services and corporate network managers who...

Persistent link: https://www.econbiz.de/10009214192

Algorithms for the Multi-Resource Generalized Assignment Problem

Gavish, Bezalel; Pirkul, Hasan - In: Management Science 37 (1991) 6, pp. 695-713

The multi-resource generalized assignment problem is encountered when a set of tasks have to be assigned to a set of agents in a way that permits assignment of multiple tasks to an agent subject to the availability of a set of multiple resources consumed by that agent. This problem differs from...

Persistent link: https://www.econbiz.de/10009191443

Note---Operations Sequencing in Discrete Parts Manufacturing

Bard, Jonathan F.; Feo, Thomas A. - In: Management Science 35 (1989) 2, pp. 249-255

discrete parts on a CNC machine. The problem is first modeled as an integer program but recast via Lagrangian relaxation as a …

Persistent link: https://www.econbiz.de/10009191256

Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows

Desrosiers, Jacques; Sauvé, Michel; Soumis, François - In: Management Science 34 (1988) 8, pp. 1005-1022

Lagrangian method. Two Lagrangian relaxations are studied. In the first one, the time constraints are relaxed producing network …

Persistent link: https://www.econbiz.de/10009214739

A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems

Adams, Warren P.; Sherali, Hanif D. - In: Management Science 32 (1986) 10, pp. 1274-1290

through other methods. An implicit enumeration algorithm which uses Lagrangian relaxation, Benders' cutting planes, and local …

Persistent link: https://www.econbiz.de/10009204514

Un algoritmo de programacion geometrica basado en funciones penalidad-multiplicadoras

Méndez, Eduardo - In: TOP: An Official Journal of the Spanish Society of … 1 (1986) 1, pp. 23-49

Persistent link: https://www.econbiz.de/10005598338

A Capacitated Bottleneck Facility Location Problem

Dearing, P. M.; Newruck, F. C. - In: Management Science 25 (1979) 11, pp. 1093-1104

This paper considers the problem of locating capacitated facilities to meet customer demands. The objective of the problem considers both a bottleneck transportation cost and a total cost of opening facilities. The structure of the problem is similar to that of the total cost capacitated...

Persistent link: https://www.econbiz.de/10009197378