Pages that link to "Item:Q3780005"
From MaRDI portal
The following pages link to Lagrangean decomposition: A model yielding stronger lagrangean bounds (Q3780005):
Displayed 50 items.
- Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs (Q291039) (← links)
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
- An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP (Q319782) (← links)
- Cluster Lagrangean decomposition in multistage stochastic optimization (Q342253) (← links)
- Use of Lagrangian decomposition in supply chain planning (Q409926) (← links)
- An homage to Joseph-Louis Lagrange and Pierre Huard (Q537596) (← links)
- An algebraic approach to integer portfolio problems (Q541725) (← links)
- Decomposition in general mathematical programming (Q689140) (← links)
- Divide to conquer: decomposition methods for energy optimization (Q715247) (← links)
- On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems (Q721958) (← links)
- Hub-and-spoke network design and fleet deployment for string planning of liner shipping (Q727347) (← links)
- A comparison of heuristics and relaxations for the capacitated plant location problem (Q811347) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual (Q817197) (← links)
- The TV-break packing problem (Q853012) (← links)
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation (Q853887) (← links)
- A matrix generation approach for eigenvalue optimization (Q868452) (← links)
- Improved Lagrangean decomposition: An application to the generalized assignment problem (Q922948) (← links)
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures (Q933795) (← links)
- A decomposition-based pricing method for solving a large-scale MILP model for an integrated fishery (Q933875) (← links)
- A Lagrangian bound for many-to-many assignment problems (Q975754) (← links)
- A decentralized coordination mechanism for integrated production-transportation-inventory problem in the supply chain using Lagrangian relaxation (Q1001384) (← links)
- The stochastic trim-loss problem (Q1011257) (← links)
- Layering strategies for creating exploitable structure in linear and integer programs (Q1117840) (← links)
- A structural Lagrangean relaxation for two-duty period bus driver scheduling problems (Q1121170) (← links)
- A constrained Steiner tree problem (Q1129916) (← links)
- Lagrangean decomposition for integer nonlinear programming with linear constraints (Q1181738) (← links)
- An improved bounding procedure for the constrained assignment problem (Q1184442) (← links)
- An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem (Q1260745) (← links)
- Lagrangean methods for the 0-1 quadratic knapsack problem (Q1268265) (← links)
- A combined transportation and scheduling problem (Q1278587) (← links)
- A cutting-plane approach to mixed 0-1 stochastic integer programs (Q1278962) (← links)
- The return plant location problem: Modelling and resolution (Q1291663) (← links)
- Dual decomposition in stochastic integer programming (Q1306366) (← links)
- Application of the scenario aggregation approach to a two-stage, stochastic, common component, inventory problem with a budget constraint (Q1308878) (← links)
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem (Q1309925) (← links)
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem (Q1341992) (← links)
- Capacity analysis in repetitive assemble-to-order manufacturing systems (Q1342003) (← links)
- A Lagrangean decomposition solution to a single line multiproduct scheduling problem (Q1342036) (← links)
- A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points (Q1362973) (← links)
- Polyhedral analysis and decompositions for capacitated plant location-type problems (Q1383369) (← links)
- Lower bounds for the quadratic semi-assignment problem (Q1388830) (← links)
- The capacitated plant location problem (Q1390274) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (Q1630276) (← links)
- Stochastic programming for qualification management of parallel machines in semiconductor manufacturing (Q1652146) (← links)
- Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization (Q1652363) (← links)
- An improved Lagrangian relaxation algorithm for the robust generation self-scheduling problem (Q1721218) (← links)
- A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines (Q1728470) (← links)