Pages that link to "Item:Q3780005"

The following pages link to Lagrangean decomposition: A model yielding stronger lagrangean bounds (Q3780005):

Displaying 50 items.

• Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
• Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
• A new cross decomposition method for stochastic mixed-integer linear programming (Q1752218) (← links)
• Risk management for forestry planning under uncertainty in demand and prices (Q1754283) (← links)
• Duality gaps in nonconvex stochastic optimization (Q1764248) (← links)
• Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303) (← links)
• Lagrangean methods for 0-1 quadratic problems (Q1803678) (← links)
• Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
• An application-oriented guide for designing Lagrangean dual ascent algorithms (Q1824554) (← links)
• Facility location with increasing production costs (Q1869420) (← links)
• Maximal covering code multiplexing access telecommunication networks (Q1876173) (← links)
• Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
• A monotonic, dual-based bounding procedure for integer programs (Q1894724) (← links)
• A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961) (← links)
• On solving stochastic production planning problems via scenario modelling (Q1919106) (← links)
• Decomposition strategy for the stochastic pooling problem (Q1928271) (← links)
• Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems (Q1939073) (← links)
• The capacitated plant location problem with multiple facilities in the same site (Q1941959) (← links)
• Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes (Q1972019) (← links)
• A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs (Q1989733) (← links)
• A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs (Q2010085) (← links)
• An iterative dynamic programming approach for the temporal knapsack problem (Q2030285) (← links)
• Management of wind power variations in electricity system investment models. A parallel computing strategy (Q2033401) (← links)
• Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301) (← links)
• A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements (Q2146977) (← links)
• Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (Q2178343) (← links)
• Alternating Lagrangian decomposition for integrated airline crew scheduling problem (Q2189931) (← links)
• Hierarchical decompositions for MPC of resource constrained control systems: applications to building energy management (Q2245685) (← links)
• A scalable global optimization algorithm for stochastic nonlinear programs (Q2274886) (← links)
• DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems (Q2302363) (← links)
• Lagrangian relaxation of the generic materials and operations planning model (Q2303321) (← links)
• Large-scale unit commitment under uncertainty (Q2351161) (← links)
• Improved mathematical model and bounds for the crop rotation scheduling problem with adjacency constraints (Q2424771) (← links)
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
• The three-dimensional assignment and partition problems. New lower bounds (Q2457504) (← links)
• Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
• A distributed computation algorithm for solving portfolio problems with integer variables (Q2462177) (← links)
• Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
• The selection and scheduling of telecommunication calls with time windows (Q2484356) (← links)
• Capacitated facility location problem with general setup cost (Q2496021) (← links)
• A class of stochastic programs with decision dependent uncertainty (Q2502206) (← links)
• An inventory-routing problem with the objective of travel time minimization (Q2514745) (← links)
• A primal-proximal heuristic applied to the French unit-commitment problem (Q2571007) (← links)
• Optimization and reconstruction of \(hv\)-convex (0,1)-matrices (Q2573240) (← links)
• A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem (Q2629912) (← links)
• Optimizing production capacity and safety stocks in general acyclic supply chains (Q2664281) (← links)
• A horizon decomposition approach for the capacitated lot-sizing problem with setup times (Q2830951) (← links)
• Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach (Q2940060) (← links)
• Dimensioning multicast-enabled communications networks (Q3150132) (← links)
• Optimization and reconstruction of hv-convex (0,1)-matrices (Q3438901) (← links)