Pages that link to "Item:Q985305"

The following pages link to Active-constraint variable ordering for faster feasibility of mixed integer linear programs (Q985305):

Displaying 12 items.

• DASH: dynamic approach for switching heuristics (Q320816) (← links)
• Achieving MILP feasibility quickly using general disjunctions (Q336442) (← links)
• Branching on nonchimerical fractionalities (Q439902) (← links)
• Faster integer-feasibility in mixed-integer linear programs by branching to force change (Q632648) (← links)
• A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
• Zero duality gap in surrogate constraint optimization: a concise review of models (Q2255935) (← links)
• Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
• Minimal infeasible constraint sets in convex integer programs (Q2268936) (← links)
• Faster MIP solutions via new node selection rules (Q2270439) (← links)
• Solution counting algorithms for constraint-centered search heuristics (Q2272161) (← links)
• Improving strong branching by domain propagation (Q2513744) (← links)
• The feasibility pump (Q2571001) (← links)