Pages that link to "Item:Q817183"

The following pages link to About Lagrangian methods in integer optimization (Q817183):

Displaying 41 items.

• A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
• Solving a dynamic facility location problem with partial closing and reopening (Q342268) (← links)
• Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities (Q342340) (← links)
• A stabilized structured Dantzig-Wolfe decomposition method (Q359629) (← links)
• Stochastic dual dynamic programming applied to nonconvex hydrothermal models (Q439570) (← links)
• Minimizing value-at-risk in single-machine scheduling (Q513548) (← links)
• Lagrangian heuristic for a class of the generalized assignment problems (Q611434) (← links)
• A Lagrangian bound for many-to-many assignment problems (Q975754) (← links)
• On the choice of explicit stabilizing terms in column generation (Q1025985) (← links)
• 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
• Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (Q1621689) (← links)
• The min-up/min-down unit commitment polytope (Q1631659) (← links)
• Deterministic electric power infrastructure planning: mixed-integer programming model and nested decomposition algorithm (Q1653389) (← links)
• Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
• On the complexity of the unit commitment problem (Q1730706) (← links)
• A new cross decomposition method for stochastic mixed-integer linear programming (Q1752218) (← links)
• Studying properties of Lagrangian bounds for many-to-many assignment problems (Q2017507) (← links)
• Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley (Q2030657) (← links)
• A Lagrangian approach to chance constrained routing with local broadcast (Q2056917) (← links)
• A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements (Q2146977) (← links)
• Electric power infrastructure planning under uncertainty: stochastic dual dynamic integer programming (SDDiP) and parallelization scheme (Q2218888) (← links)
• Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
• Large-scale unit commitment under uncertainty (Q2351161) (← links)
• Calculating the best dual bound for problems with multiple Lagrangian relaxations (Q2391512) (← links)
• On parallelizing dual decomposition in stochastic integer programming (Q2450615) (← links)
• Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem (Q2482376) (← links)
• Perspective cuts for a class of convex 0-1 mixed integer programs (Q2490334) (← links)
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
• New approaches for optimizing over the semimetric polytope (Q2576727) (← links)
• A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem (Q2629912) (← links)
• A multiperiod drayage problem with customer-dependent service periods (Q2668610) (← links)
• Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518) (← links)
• Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities (Q4599310) (← links)
• The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches (Q5136080) (← links)
• Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
• A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs (Q6087142) (← links)
• Time-flexible min completion time variance in a single machine by quadratic programming (Q6090146) (← links)
• A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem (Q6114936) (← links)
• Refinement of Lagrangian bounds in optimization problems (Q6122370) (← links)
• Consensus-based Dantzig-Wolfe decomposition (Q6167387) (← links)
• Feasibility jump: an LP-free Lagrangian MIP heuristic (Q6175707) (← links)