A Survey of Lagrangean Techniques for Discrete Optimization
From MaRDI portal
Publication:4198339
DOI10.1016/S0167-5060(08)70346-7zbMath0411.90054MaRDI QIDQ4198339
Publication date: 1979
Published in: Discrete Optimization II, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Aha. and Vancouver (Search for Journal in Brave)
surveyLagrange multipliersinteger programmingduality gapdiscrete optimizationnetwork optimizationboolean programming
Programming involving graphs or networks (90C35) Integer programming (90C10) Numerical methods involving duality (49M29) Boolean programming (90C09) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Lagrangean relaxation. (With comments and rejoinder)., Lagrangean relaxation and decomposition in an uncapacitated 2-hierarchal location-allocation problem, Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms, Hierarchical approach to the process planning problem, Maximal chordal subgraphs, Application of Lagrangian relaxation to computer network control, Combinatorial Heuristics for Inventory Routing Problems, On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms, Lagrangian heuristic for a class of the generalized assignment problems, Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs, Use of Lagrangian decomposition in supply chain planning, Refinement of Lagrangian bounds in optimization problems, Feasibility jump: an LP-free Lagrangian MIP heuristic, A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, A heuristic decomposition approach to optimal control in a water supply model, Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes, Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, A Langrangean heuristic for the \(p_ k\)-median dynamic location problem, Multi-level multi-item lot size planning with limited resources and general manufacturing structure., Capacitated lot-sizing and scheduling by Lagrangean relaxation, Stochastic facility location with general long-run costs and convex short-run costs, A modified subgradient algorithm for Lagrangean relaxation, Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs, A decomposition technique for mixed integer programming problems, A Lagrangian bound for many-to-many assignment problems, Effective Algorithms for a Class of Discrete Valued Optimal Control Problems, A new exchange property for matroids and its application to max-min-problems, Studying properties of Lagrangian bounds for many-to-many assignment problems, Towards strong duality in integer programming, Convergent Lagrangian and domain cut method for nonlinear knapsack problems, Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop, An optimisation-oriented model of distributed supply-chain, An exact method for the two-echelon, single-source, capacitated facility location problem, Distance confined path problem and separable integer programming, The simple plant location problem: Survey and synthesis, Large-scale mixed integer programming: Benders-type heuristics, Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems, A heuristic lagrangean algorithm for the capacitated plant location problem, Solving capacitated clustering problems, An interactive procedure for multiple objective integer linear programming problems, Cellular control of manufacturing systems, A multiple objective interactive Lagrangean relaxation approach, Generalized nonlinear Lagrangian formulation for bounded integer programming, Capital budgeting with Benders' decomposition, The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm, State space relaxation for set covering problems related to bus driver scheduling, A nonlinear Lagrangian dual for integer programming
