Pages that link to "Item:Q2571002"

The following pages link to On a primal-proximal heuristic in discrete optimization (Q2571002):

Displaying 10 items.

• Towards an objective feasibility pump for convex minlps (Q263161) (← links)
• Decomposition algorithm for large-scale two-stage unit-commitment (Q271986) (← links)
• Proximity search for 0--1 mixed-integer convex programming (Q524882) (← links)
• Divide to conquer: decomposition methods for energy optimization (Q715247) (← links)
• Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
• Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley (Q2030657) (← links)
• Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity (Q2281266) (← links)
• Large-scale unit commitment under uncertainty (Q2351161) (← links)
• A comparison of four approaches from stochastic programming for large-scale unit-commitment (Q2397759) (← links)
• A primal-proximal heuristic applied to the French unit-commitment problem (Q2571007) (← links)