Database Location in Computer Networks
Journal of the ACM (JACM)
Distributed throughput-maximization using the up- and downlink duality in wireless networks
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
A Lagrangean relaxation approach for the mixed-model flow line sequencing problem
Computers and Operations Research
Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
Computers and Operations Research
DisLRPɑ: ɑ-approximation in generalized mutual assignment
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Computation of approximate α-points for large scale single machine scheduling problem
Computers and Operations Research
The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
Computers and Operations Research
A virtual pegging approach to the max-min optimization of the bi-criteria knapsack problem
International Journal of Computer Mathematics
Channel assignment in multi-radio wireless mesh networks: a graph-theoretic approach
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
An ant colony optimization approach to the multiple-choice multidimensional knapsack problem
Proceedings of the 12th annual conference on Genetic and evolutionary computation
CoPhy: a scalable, portable, and interactive index advisor for large workloads
Proceedings of the VLDB Endowment
A Lagrangian approach for minimum cost single round robin tournaments
Computers and Operations Research
A Lagrangian relaxation approach for a large scale new variant of capacitated clustering problem
Computers and Industrial Engineering
MIRAGE'11 Proceedings of the 5th international conference on Computer vision/computer graphics collaboration techniques
Information Sciences: an International Journal
A hybrid solution to collaborative decision-making in a decentralized supply-chain
Journal of Engineering and Technology Management
Lagrangean Relaxation Parallel Method for Optimizing of a Hydroelectric Generation System
Electronic Notes in Theoretical Computer Science (ENTCS)
Optimizing quality of service in real-time systems under energy constraints
ACM SIGOPS Operating Systems Review
Reliable facility location design under disruptions
Computers and Operations Research
Multiple hypothesis tracking for data association in vehicular networks
Information Fusion
A novel service selection based on resource-directive decomposition
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Network Selection for Multicast Groups in Heterogeneous Wireless Environments
Proceedings of International Conference on Advances in Mobile Computing & Multimedia
A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
Computers and Operations Research
A branch-and-bound algorithm for assembly line worker assignment and balancing problems
Computers and Operations Research
A new outlook on routing in cognitive radio networks: minimum-maintenance-cost routing
IEEE/ACM Transactions on Networking (TON)
The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm
Discrete Applied Mathematics
| Hi-index | 0.01 |
(This article originally appeared in Management Science, January 1981, Volume 27, Number 1, pp. 1-18, published by The Institute of Management Sciences.) One of the most computationally useful ideas of the 1970s is the observation that many hard integer programming problems can be viewed as easy problems complicated by a relatively small set of side constraints. Dualizing the side constraints produces a Lagrangian problem that is easy to solve and whose optimal value is a lower bound (for minimization problems) on the optimal value of the original problem. The Lagrangian problem can thus be used in place of a linear programming relaxation to provide bounds in a branch and bound algorithm. This approach has led to dramatically improved algorithms for a number of important problems in the areas of routing, location, scheduling, assignment and set covering. This paper is a review of Lagrangian relaxation based on what has been learned in the last decade.