Lagrangean decomposition: A model yielding stronger lagrangean bounds

DOI10.1007/BF02592954zbMath0638.90074OpenAlexW1989023497MaRDI QIDQ3780005

Publication date: 1987

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02592954

zbMATH Keywords

Lagrangean relaxation Lagrangean decomposition integrality property block-angularization bound improvement two matrix constraints Y-convexity

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Decomposition methods (49M27)

Related Items

Heuristics for the multi-resource generalized assignment problem, Consistency Cuts for Dantzig-Wolfe Reformulations, Polyhedral results and stronger Lagrangean bounds for stable spanning trees, Scalable timing-aware network design via Lagrangian decomposition, Refinement of Lagrangian bounds in optimization problems, Inexact penalty decomposition methods for optimization problems with geometric constraints, A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution, COLLABORATIVE PLANNING IN SUPPLY CHAINS BY LAGRANGIAN RELAXATION AND GENETIC ALGORITHMS, Designing a minimal spanning tree network subject to a budget constraint, A CONVEX SUBMODEL WITH APPLICATION TO SYSTEM DESIGN, The multi-hour service system design problem, Coordination between strategic forest management and tactical logistic and production planning in the forestry supply chain, Challenges in Enterprise Wide Optimization for the Process Industries, Modeling and Managing Uncertainty in Process Planning and Scheduling, Constraint programming and operations research, Maximal covering code multiplexing access telecommunication networks, Lagrangean relaxation. (With comments and rejoinder)., Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs, A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems, The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation, A Lagrangean heuristic for the capacitated concave minimum cost network flow problem, Capacity analysis in repetitive assemble-to-order manufacturing systems, A Lagrangean decomposition solution to a single line multiproduct scheduling problem, A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem, A monotonic, dual-based bounding procedure for integer programs, An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP, A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements, The TV-break packing problem, Solving the \(p\)-median problem with a semi-Lagrangian relaxation, Stochastic programming for qualification management of parallel machines in semiconductor manufacturing, Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization, A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points, A reformulation-convexification approach for solving nonconvex quadratic programming problems, Cluster Lagrangean decomposition in multistage stochastic optimization, A matrix generation approach for eigenvalue optimization, Layering strategies for creating exploitable structure in linear and integer programs, A structural Lagrangean relaxation for two-duty period bus driver scheduling problems, On solving stochastic production planning problems via scenario modelling, Optimizing production capacity and safety stocks in general acyclic supply chains, Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach, Polyhedral analysis and decompositions for capacitated plant location-type problems, Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints, A constrained Steiner tree problem, Decomposition strategy for the stochastic pooling problem, Lower bounds for the quadratic semi-assignment problem, The capacitated plant location problem, Alternating Lagrangian decomposition for integrated airline crew scheduling problem, Use of Lagrangian decomposition in supply chain planning, Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems, Improved mathematical model and bounds for the crop rotation scheduling problem with adjacency constraints, The capacitated plant location problem with multiple facilities in the same site, The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches, Improved Lagrangean decomposition: An application to the generalized assignment problem, An improved Lagrangian relaxation algorithm for the robust generation self-scheduling problem, A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines, Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes, Large-scale unit commitment under uncertainty: an updated literature survey, A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures, A decomposition-based pricing method for solving a large-scale MILP model for an integrated fishery, The three-dimensional assignment and partition problems. New lower bounds, Lagrangean decomposition for integer nonlinear programming with linear constraints, An improved bounding procedure for the constrained assignment problem, Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem, A distributed computation algorithm for solving portfolio problems with integer variables, Formulations and exact algorithms for the vehicle routing problem with time windows, A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs, Hierarchical decompositions for MPC of resource constrained control systems: applications to building energy management, A new cross decomposition method for stochastic mixed-integer linear programming, Risk management for forestry planning under uncertainty in demand and prices, Decomposition in general mathematical programming, An homage to Joseph-Louis Lagrange and Pierre Huard, The selection and scheduling of telecommunication calls with time windows, An algebraic approach to integer portfolio problems, Duality gaps in nonconvex stochastic optimization, A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs, A Lagrangian bound for many-to-many assignment problems, Lagrangian decomposition of block-separable mixed-integer all-quadratic programs, Capacitated facility location problem with general setup cost, Divide to conquer: decomposition methods for energy optimization, A scalable global optimization algorithm for stochastic nonlinear programs, A class of stochastic programs with decision dependent uncertainty, On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems, An iterative dynamic programming approach for the temporal knapsack problem, Hub-and-spoke network design and fleet deployment for string planning of liner shipping, Management of wind power variations in electricity system investment models. A parallel computing strategy, A decentralized coordination mechanism for integrated production-transportation-inventory problem in the supply chain using Lagrangian relaxation, An inventory-routing problem with the objective of travel time minimization, Lagrangean methods for 0-1 quadratic problems, The stochastic trim-loss problem, An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem, Lagrangean/surrogate relaxation for generalized assignment problems, DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems, Lagrangian relaxation of the generic materials and operations planning model, Lagrangean methods for the 0-1 quadratic knapsack problem, Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design, A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times, A combined transportation and scheduling problem, A cutting-plane approach to mixed 0-1 stochastic integer programs, An application-oriented guide for designing Lagrangean dual ascent algorithms, The return plant location problem: Modelling and resolution, A primal-proximal heuristic applied to the French unit-commitment problem, Optimization and reconstruction of \(hv\)-convex (0,1)-matrices, Dual decomposition in stochastic integer programming, Application of the scenario aggregation approach to a two-stage, stochastic, common component, inventory problem with a budget constraint, An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem, Optimization and reconstruction of hv-convex (0,1)-matrices, The Multicommodity Multilevel Bottleneck Assignment Problem, Large-scale unit commitment under uncertainty, A comparison of heuristics and relaxations for the capacitated plant location problem, Facility location with increasing production costs, Dimensioning multicast-enabled communications networks, About Lagrangian methods in integer optimization, The multidimensional 0-1 knapsack problem -- bounds and computational aspects, An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual

Cites Work