On obtaining the ‘best’ multipliers for a lagrangean relaxation for integer programming
References (23)
- et al.
An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
(1974) An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
Ops Res.
(1976)- et al.
Finding Everett's Lagrange Multipliers by Linear Programming
Ops Res.
(1966) - et al.
An All Zero-One Algorithm for a Certain Class of Transportation Problems
Ops Res.
(1971) Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
Ops Res.
(1963)- et al.
Municipal Bond Coupon Schedules with Limitations on the Number of Different Coupon Values
(1977) How Can Specialized Discrete and Convex Optimization Methods be Married
Lagrangean Relaxation for Integer Programming
Math. Programming Study
(1974)- et al.
Multicommodity Distribution System Design by Benders Decomposition
Mgt Sci.
(1974) The Construction of Class-Teacher Timetables
Validation of Subgradient Optimization
Math. Prog.
Cited by (54)
Integrated strategic and tactical planning in a supply chain network design with a heuristic solution method
2013, Computers and Operations ResearchTwo-echelon, multi-commodity supply chain network design with mode selection, lead-times and inventory costs
2012, Computers and Operations ResearchA theoretical and empirical investigation on the Lagrangian capacities of the 0-1 multidimensional knapsack problem
2012, European Journal of Operational ResearchCitation Excerpt :However, in this paper, we focus on finding good lower bounds, i.e., good feasible solutions. There have been a number of papers that studied Lagrangian method for discrete problems (Beasley, 1990a; Chang and Wah, 1995; Everett, 1963; Gavish, 1978; Geoffrion, 1974; Schuurmans et al., 2001; Wah and Shang, 1997; Wah and Wu, 1999). There were also a few methods that used Lagrange multipliers for 0-1 MKP.
The combinatorial bandwidth packing problem
2011, European Journal of Operational ResearchA multiple server location-allocation model for service system design
2008, Computers and Operations ResearchDesigning a distribution network in a supply chain system: Formulation and efficient solution procedure
2006, European Journal of Operational ResearchCitation Excerpt :If we let ZL(α, β) be the value of the Lagrangean function with a multiplier vector (α, β), then the best bound using this relaxation is derived by calculating ZL(α*, β*) = Max(α,β){ZL(α, β)}. In this study we use the subgradient optimization method to search for “good” multipliers [3,6,10]. As an integral part of the subgradient optimization method, a heuristic procedure, called DESIGN, to solve problem DistriNet is developed.
- ∗
Bezalel Gavish is an Assistant Professor of Computers and Information Systems and Operations Research at the Graduate School of Management, University of Rochester. He received his MSc. and Ph.D. from the Department of Industrial Engineering and Management Science at the Technion Israel Institute of Technology. He had previously been a department head for Systems Analysis and Scientific Programming (1969–1973), and a staff member of the IBM Israel Scientific Center (1973–1976). His publications have appeared in Management Science, IEEE Trans. and other professional journals.