Pages that link to "Item:Q2340280"

The following pages link to Modified orbital branching for structured symmetry with an application to unit commitment (Q2340280):

Displaying 17 items.

• The min-up/min-down unit commitment polytope (Q1631659) (← links)
• Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs (Q1652711) (← links)
• Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
• Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions (Q1753550) (← links)
• Political districting to minimize cut edges (Q2099493) (← links)
• Symmetry-breaking inequalities for ILP with structured sub-symmetry (Q2196292) (← links)
• Modeling flexible generator operating regions via chance-constrained stochastic unit commitment (Q2221469) (← links)
• Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem (Q2227540) (← links)
• Polytopes associated with symmetry handling (Q2414904) (← links)
• A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters (Q2693785) (← links)
• A semidefinite relaxation based global algorithm for two-level graph partition problem (Q2698612) (← links)
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem (Q5137957) (← links)
• On Mixed-Integer Programming Formulations for the Unit Commitment Problem (Q5148170) (← links)
• Optimization for Power Systems and the Smart Grid (Q5351612) (← links)
• On the geometry of symmetry breaking inequalities (Q5918422) (← links)
• An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints (Q6166655) (← links)
• Exploiting symmetry for the job sequencing and tool switching problem (Q6565440) (← links)