Pages that link to "Item:Q2892306"

The following pages link to Enhancing Lagrangian dual optimization for linear programs by obviating nondifferentiability (Q2892306):

Displaying 8 items.

• The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation (Q322969) (← links)
• An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q339586) (← links)
• Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
• A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs (Q857822) (← links)
• Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization (Q989841) (← links)
• Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
• An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863) (← links)
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288) (← links)