A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality

From MaRDI portal
Publication:1257414

DOI10.1016/0377-2217(79)90228-5zbMath0405.90062OpenAlexW2004001651MaRDI QIDQ1257414

Jamie J. Goode, Mokhtar S. Bazaraa

Publication date: 1979

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(79)90228-5



Related Items

Efficient algorithms for the capacitated concentrator location problem, A computational evaluation of two subgradient search methods, New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation, Solution procedures for the service system design problem, Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs, Routing and capacity assignment in backbone communication networks, A Lagrangian relaxation-based heuristic for the vehicle routing with full container load, The capacitated maximal covering location problem with backup service, A surrogate and Lagrangian approach to constrained network problems, Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen, The hierarchical network design problem with transshipment facilities, Bandwidth packing with priority classes, A multiple server location-allocation model for service system design, Locating concentrators in centralized computer networks, Capacitated lot-sizing and scheduling by Lagrangean relaxation, Capacitated emergency facility siting with multiple levels of backup, The multi-hour service system design problem, A modified subgradient algorithm for Lagrangean relaxation, The selection and scheduling of telecommunication calls with time windows, A coordinated planning model for the design of a distributed database system, Some relationships between lagrangian and surrogate duality in integer programming, The traveling salesman problem: A duality approach, A Benders decomposition based heuristic for the hierarchical production planning problem, A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions, An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality, An interactive method as an aid in solving multi-objective mathematical programming problems, Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures, Primary and secondary route selection in backbone communication networks, The design of service systems with queueing time cost, workload capacities and backup service, Routing and capacity assignment in backbone communication networks under time varying traffic conditions, An integrated approach for planning the adoption of client/server systems, A comparison of two dual-based procedures for solving the p-median problem, Cellular control of manufacturing systems, Development and evaluation of an assignment heuristic for allocating cross-trained workers, Designing a distribution network in a supply chain system: formulation and efficient solution procedure, Optimal set partitioning, matchings and lagrangian duality



Cites Work