Pages that link to "Item:Q1257414"

The following pages link to A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality (Q1257414):

Displaying 36 items.

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