Pages that link to "Item:Q1575065"
From MaRDI portal
The following pages link to The volume algorithm: Producing primal solutions with a subgradient method (Q1575065):
Displaying 50 items.
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
- Decomposition based hybrid metaheuristics (Q319285) (← 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)
- Resource constraint scheduling with a fractional shared resource (Q408404) (← links)
- The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
- Algorithms for large scale shift minimisation personnel task scheduling problems (Q439608) (← links)
- An exact cooperative method for the uncapacitated facility location problem (Q495932) (← links)
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method (Q526844) (← links)
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
- On embedding the volume algorithm in a variable target value method. (Q703259) (← links)
- Stochastic set packing problem (Q713096) (← 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)
- GRASP with path-relinking for the generalized quadratic assignment problem (Q763245) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming (Q839882) (← links)
- A cutting plane algorithm for the capacitated facility location problem (Q842775) (← links)
- Convergence and computational analyses for some variable target value and subgradient deflection methods (Q853561) (← links)
- A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs (Q857822) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- Computational study of large-scale \(p\)-median problems (Q868446) (← links)
- A dual ascent procedure for the set partitioning problem (Q955334) (← 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)
- Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization (Q989841) (← links)
- Two ``well-known'' properties of subgradient optimization (Q1016352) (← links)
- An effective heuristic for large-scale capacitated facility location problems (Q1044245) (← links)
- On some difficult linear programs coming from set partitioning (Q1348247) (← links)
- On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. (Q1410305) (← 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)
- A Lagrangian search method for the \(P\)-median problem (Q1675643) (← links)
- Decentralised scheduling with confidentiality protection (Q1694787) (← links)
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem (Q1711458) (← links)
- Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
- Near-optimal solutions to large-scale facility location problems (Q1779687) (← links)
- An effective line search for the subgradient method (Q1781859) (← links)
- An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
- Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
- Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
- Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
- Could we use a million cores to solve an integer program? (Q1935943) (← links)
- Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems (Q1939073) (← links)
- Portfolio optimization with two coherent risk measures (Q2022182) (← links)
- An iterative dynamic programming approach for the temporal knapsack problem (Q2030285) (← links)
