Pages that link to "Item:Q1876461"
From MaRDI portal
The following pages link to Lagrangean relaxation. (With comments and rejoinder). (Q1876461):
Displaying 50 items.
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
- Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound (Q323168) (← links)
- Incorporating location, inventory and price decisions into a supply chain distribution network design problem (Q337462) (← links)
- Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization (Q339591) (← links)
- Cluster Lagrangean decomposition in multistage stochastic optimization (Q342253) (← links)
- Use of Lagrangian decomposition in supply chain planning (Q409926) (← links)
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem (Q434153) (← links)
- Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment (Q486936) (← links)
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
- A parallelized lagrangean relaxation approach for the discrete ordered median problem (Q512991) (← links)
- An homage to Joseph-Louis Lagrange and Pierre Huard (Q537596) (← links)
- The single period coverage facility location problem: Lagrangean heuristic and column generation approaches (Q610996) (← links)
- Lagrangean bounds for the optimum communication spanning tree problem (Q611003) (← links)
- Discrete location for bundled demand points (Q611011) (← links)
- An exact solution procedure for multi-item two-echelon spare parts inventory control problem with batch ordering in the central warehouse (Q613357) (← links)
- Stochastic set packing problem (Q713096) (← links)
- Divide to conquer: decomposition methods for energy optimization (Q715247) (← links)
- Hub-and-spoke network design and fleet deployment for string planning of liner shipping (Q727347) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- Tight bounds from a path based formulation for the tree of hub location problem (Q833527) (← links)
- On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming (Q839882) (← links)
- A Lagrangian bound for many-to-many assignment problems (Q975754) (← links)
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
- A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem (Q991376) (← links)
- The radar method: An effective line search for piecewise linear concave functions (Q1026577) (← links)
- Lagrangean relaxation for the capacitated hub location problem with single assignment (Q1027993) (← links)
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem (Q1044139) (← links)
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712) (← links)
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (Q1630276) (← links)
- An exact algorithm for the modular hub location problem with single assignments (Q1652348) (← links)
- Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization (Q1652363) (← links)
- Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem (Q1705774) (← links)
- Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
- Natalie 2.0: sparse global network alignment as a special case of quadratic assignment (Q1736730) (← links)
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
- Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
- A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems (Q1751680) (← links)
- Heuristics for multi-item two-echelon spare parts inventory control subject to aggregate and individual service measures (Q1752179) (← links)
- Risk management for forestry planning under uncertainty in demand and prices (Q1754283) (← links)
- Multi-period stochastic covering location problems: modeling framework and solution approach (Q1754338) (← links)
- A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty (Q1761157) (← links)
- Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints (Q1761747) (← links)
- Lagrangean relaxation heuristics for the \(p\)-cable-trench problem (Q1762012) (← links)
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm (Q1762137) (← links)
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint (Q1926741) (← links)
- Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems (Q1939073) (← links)
- Fixed cardinality stable sets (Q1983123) (← links)
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
- A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables (Q2010099) (← links)
